Generalized full sparse tiling of loop chains
| dc.contributor.author | Krieger, Christopher D., author | |
| dc.contributor.author | Strout, Michelle Mills, advisor | |
| dc.contributor.author | Böhm, Wim, committee member | |
| dc.contributor.author | Rajopadhye, Sanjay, committee member | |
| dc.contributor.author | Mueller, Jennifer, committee member | |
| dc.date.accessioned | 2007-01-03T06:08:49Z | |
| dc.date.available | 2007-01-03T06:08:49Z | |
| dc.date.issued | 2013 | |
| dc.description.abstract | Computer and computational scientists are tackling increasingly large and complex problems and are seeking ways of improving the performance of their codes. The key issue faced is how to reach an effective balance between parallelism and locality. In trying to reach this balance, a problem commonly encountered is that of ascertaining the data dependences. Approaches that rely on automatic extraction of data dependences are frequently stymied by complications such as interprocedural and alias analysis. Placing the dependence analysis burden upon the programmer creates a significant barrier to adoption. In this work, we present a new programming abstraction, the loop chain, that specifies a series of loops and the data they access. Given this abstraction, a compiler, inspector, or runtime optimizer can avoid the computationally expensive process of formally determining data dependences, yet still determine beneficial and legal data and iteration reorderings. One optimization method that has been previously applied to irregular scientific codes is full sparse tiling. Full sparse tiling has been used to improve the performance of a handful of scientific codes, but in each case the technique had to be applied from scratch by an expert after careful manual analysis of the possible data dependence patterns. The full sparse tiling approach was extended and generalized as part of this work to apply to any code represented by the loop chain abstraction. Using only the abstraction, the generalized algorithm can produce a new data and iteration ordering as well as a parallel execution schedule. Insight into tuning a generalized full sparse tiled application was gained through a study of the different factors influencing tile count. This work lays the foundation for an efficient autotuning approach to optimizing tile count. | |
| dc.format.medium | born digital | |
| dc.format.medium | doctoral dissertations | |
| dc.identifier | Krieger_colostate_0053A_12019.pdf | |
| dc.identifier | ETDF2013500310COMS | |
| dc.identifier.uri | http://hdl.handle.net/10217/80954 | |
| 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.subject | compilers | |
| dc.subject | run-time optimization | |
| dc.subject | parallelization | |
| dc.title | Generalized full sparse tiling of loop chains | |
| 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 | Doctoral | |
| thesis.degree.name | Doctor of Philosophy (Ph.D.) |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Krieger_colostate_0053A_12019.pdf
- Size:
- 1.85 MB
- Format:
- Adobe Portable Document Format
- Description: