IEGen: semi-automatic generation of inspectors and executors
| dc.contributor.author | LaMielle, Alan, author | |
| dc.contributor.author | Strout, Michelle, advisor | |
| dc.contributor.author | Rajopadhye, Sanjay Vishnu, committee member | |
| dc.contributor.author | Liu, Jiangguo, committee member | |
| dc.date.accessioned | 2007-01-03T04:39:02Z | |
| dc.date.available | 2007-01-03T04:39:02Z | |
| dc.date.issued | 2010 | |
| dc.description | Department Head: L. Darrell Whitley. | |
| dc.description.abstract | Software that simulates real-world phenomena such as heat transfer over surfaces and molecular interaction is often based on irregular computational kernels. Indirect array accesses such as A[B[i]] that are found in irregular computations often exhibit a memory access pattern that does not make efficient use of the memory hierarchy, reducing performance. Additionally, indirect array accesses hinder our ability to apply loop optimizations to improve data locality or introduce parallelism at compile time. One approach to solving this problem, an inspector/executor strategy, inspects the index arrays (B) at runtime to determine the order of accesses to the data arrays (A), reorders the data and index arrays, and executes a transformed computation that accesses the data arrays in a more efficient manner. For the most part, the application of inspector/executor strategies to irregular computations has been done manually or with limited generality. This thesis presents the Inspector/Executor Generator (IEGen). This tool accepts an irregular computation specification and sequence of run-time reordering transformations to apply to that computation as input. IEGen then generates serial inspector and executor code that implements the transformed computation. We contribute an inspector intermediate representation (IR) called an Inspector Dependence Graph (IDG), a method for code generation of inspectors based on an IDG, a method for code generation of executors, and techniques for manipulating affine constraints with uninterpreted function symbol (UFS) expressions to enable code generation. We evaluate our techniques against an existing library that supports limited UFS expressions and additionally show that generalized generation of inspectors and executors that implement composed run-time reordering transformations is possible. | |
| dc.format.medium | masters theses | |
| dc.identifier | 2010_Spring_LaMielle_Alan.pdf | |
| dc.identifier.uri | http://hdl.handle.net/10217/38194 | |
| dc.language | English | |
| dc.language.iso | eng | |
| dc.publisher | Colorado State University. Libraries | |
| dc.relation.ispartof | 2000-2019 | |
| dc.rights | Copyright and other restrictions may apply. User is responsible for compliance with all applicable laws. For information about copyright law, please see https://libguides.colostate.edu/copyright. | |
| dc.title | IEGen: semi-automatic generation of inspectors and executors | |
| dc.type | Text | |
| dcterms.rights.dpla | This Item is protected by copyright and/or related rights (https://rightsstatements.org/vocab/InC/1.0/). You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s). | |
| thesis.degree.discipline | Computer Science | |
| thesis.degree.grantor | Colorado State University | |
| thesis.degree.level | Masters | |
| thesis.degree.name | Master of Science (M.S.) |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- 2010_Spring_LaMielle_Alan.pdf
- Size:
- 456.21 KB
- Format:
- Adobe Portable Document Format
- Description: