<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/xsl'?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T08:57:19Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/10167" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/10167</identifier><datestamp>2026-05-14T13:56:16Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author">White, Brian</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2008-03-13T18:15:26Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2013-03-13T06:25:18Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2008-03-13T18:15:26Z</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/10167</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">6397097</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Computational scientists are frequently confronted with a choice:  implement algorithms using high-level &#xd;
abstractions, such as matrices and mesh entities, for greater programming productivity or code them using low-level &#xd;
language constructs for greater execution efficiency.  We have observed that the cost of implementing a representative &#xd;
unstructured mesh code with high-level abstractions is poor computational intensity---the ratio of &#xd;
floating point operations to memory accesses. &#xd;
Related scientific applications frequently produce little ``science per cycle'' because their abstractions both introduce additional overhead and hinder compiler analysis and subsequent optimization. Our work exploits the semantics of abstractions, as employed in unstructured mesh codes, to overcome &#xd;
these limitations and to guide a series of manual, domain-specific optimizations that significantly improve computational intensity. &#xd;
&#xd;
We propose a framework for the automation of such high-level optimizations within the ROSE  &#xd;
source-to-source compiler infrastructure.   &#xd;
The specification of optimizations is left to  &#xd;
domain experts and library writers who best understand the semantics of their applications and libraries and who are thus best poised to describe their optimization.   &#xd;
Our source-to-source approach translates different constructs (e.g., C code written in &#xd;
a procedural style or C++ code written in an object-oriented style) to a procedural form in order to simplify the specification of optimizations.  This is accomplished &#xd;
through raising operators, which are specified by a domain expert and are used to  &#xd;
project a concrete application from an implementation space to an abstraction space, where optimizations are applied. &#xd;
The transformed code in the abstraction space is then reified as a concrete implementation via lowering operators, which are automatically inferred by inverting the &#xd;
raising operators.  Applying optimizations within the abstraction space, rather &#xd;
than the implementation space, leads to greater optimization portability. &#xd;
&#xd;
We use this framework to automate two high-level optimizations.  The first uses an inspector/executor approach to avoid costly &#xd;
and redundant traversals of a static mesh by memoizing the relatively few references required to perform the mathematical &#xd;
computations.  During the executor phase, the stored entities are accessed directly without resort to the indirection inherent in the original traversal.  The second optimization lowers an object-oriented mesh framework, which uses C++ objects to access the mesh and &#xd;
iterate over mesh entities, to a low-level implementation, which uses integer-based access and iteration.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="sponsorship" lang="en_US">Support was provided by a DOE High-Performance Computer Science Fellowship administered by The Krell Institute, Ames, IA.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en_US</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">unstructured mesh</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">compiler optimization</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">high-level abstraction</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">A Semantics-Based Approach to Optimizing Unstructured Mesh Abstractions</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author">White, Brian</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="a9b53486-d483-478a-b9d1-a99579aaad52">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>en_US&lt;/Language>
   	&lt;Title>A Semantics-Based Approach to Optimizing Unstructured Mesh Abstractions&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2008-03-13T18:15:26Z&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>White, Brian&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;Keyword>unstructured mesh&lt;/Keyword>
    &lt;Keyword>compiler optimization&lt;/Keyword>
    &lt;Keyword>high-level abstraction&lt;/Keyword>
   	&lt;Abstract>Computational scientists are frequently confronted with a choice:  implement algorithms using high-level &#xd;
abstractions, such as matrices and mesh entities, for greater programming productivity or code them using low-level &#xd;
language constructs for greater execution efficiency.  We have observed that the cost of implementing a representative &#xd;
unstructured mesh code with high-level abstractions is poor computational intensity---the ratio of &#xd;
floating point operations to memory accesses. &#xd;
Related scientific applications frequently produce little ``science per cycle&amp;apos;&amp;apos; because their abstractions both introduce additional overhead and hinder compiler analysis and subsequent optimization. Our work exploits the semantics of abstractions, as employed in unstructured mesh codes, to overcome &#xd;
these limitations and to guide a series of manual, domain-specific optimizations that significantly improve computational intensity. &#xd;
&#xd;
We propose a framework for the automation of such high-level optimizations within the ROSE  &#xd;
source-to-source compiler infrastructure.   &#xd;
The specification of optimizations is left to  &#xd;
domain experts and library writers who best understand the semantics of their applications and libraries and who are thus best poised to describe their optimization.   &#xd;
Our source-to-source approach translates different constructs (e.g., C code written in &#xd;
a procedural style or C++ code written in an object-oriented style) to a procedural form in order to simplify the specification of optimizations.  This is accomplished &#xd;
through raising operators, which are specified by a domain expert and are used to  &#xd;
project a concrete application from an implementation space to an abstraction space, where optimizations are applied. &#xd;
The transformed code in the abstraction space is then reified as a concrete implementation via lowering operators, which are automatically inferred by inverting the &#xd;
raising operators.  Applying optimizations within the abstraction space, rather &#xd;
than the implementation space, leads to greater optimization portability. &#xd;
&#xd;
We use this framework to automate two high-level optimizations.  The first uses an inspector/executor approach to avoid costly &#xd;
and redundant traversals of a static mesh by memoizing the relatively few references required to perform the mathematical &#xd;
computations.  During the executor phase, the stored entities are accessed directly without resort to the indirection inherent in the original traversal.  The second optimization lowers an object-oriented mesh framework, which uses C++ objects to access the mesh and &#xd;
iterate over mesh entities, to a low-level implementation, which uses integer-based access and iteration.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>