Incorporating domain-specific information into the compilation process
| dc.contributor.advisor | Lin, Yun Calvin | en |
| dc.creator | Guyer, Samuel Zev | en |
| dc.date.accessioned | 2011-06-29T19:59:05Z | en |
| dc.date.available | 2011-06-29T19:59:05Z | en |
| dc.date.issued | 2003-05 | en |
| dc.description | text | en |
| dc.description.abstract | Despite many advances in compiler research, traditional compilers continue to suffer from one significant limitation: they only recognize the low-level primitive constructs of their languages. In contrast, programmers increasingly benefit from higher level software components, which implement a variety of specialized domains—everything from basic file access to 3D graphics and parallel programming. The result is a marked difference between the level of abstraction in software development and the level of abstraction in compilation. In this thesis we present the Broadway compiler, which closes this gap. Broadway represents a new kind of compiler, called a library-level compiler, that supports domainspecific compilation by extending the benefits of compiler support to software libraries. The key to our approach is a separate annotation language that conveys domain-specific information about libraries to our compiler, allowing it to treat library routines more like built-in language operations. Using this information, the compiler can perform library-level program analysis and apply library-level optimizations. We explore both the opportunities and challenges presented by library-level compilation. We show that library-level optimizations can increase the performance of several parallel programs written using a highly-tuned parallel linear algebra library. These highlevel optimizations are beyond the capabilities of a traditional compiler and even rival the performance of programs hand-coded by an expert. We also show that our compiler is an effective tool for detecting a range of library-level errors, including several significant security vulnerabilities. Finally, we present a new client-driven pointer analysis algorithm, which provides precise and scalable program analysis to meet the demanding requirements of library-level compilation. | |
| dc.description.department | Computer Sciences | en |
| dc.format.medium | electronic | en |
| dc.identifier.uri | http://hdl.handle.net/2152/11982 | en |
| dc.language.iso | eng | en |
| dc.rights | Copyright is held by the author. Presentation of this material on the Libraries' web site by University Libraries, The University of Texas at Austin was made possible under a limited license grant from the author who has retained all copyrights in the works. | en |
| dc.rights.restriction | Restricted | en |
| dc.subject | Compilers (Computer programs) | en |
| dc.subject | Programming languages (Electronic computers) | en |
| dc.title | Incorporating domain-specific information into the compilation process | en |
| thesis.degree.department | Computer Sciences | en |
| thesis.degree.discipline | Computer Sciences | en |
| thesis.degree.grantor | The University of Texas at Austin | en |
| thesis.degree.level | Doctoral | en |
| thesis.degree.name | Doctor of Philosophy | en |
Access full-text files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- guyersz032.pdf
- Size:
- 765.39 KB
- Format:
- Adobe Portable Document Format
- Description:
- Restricted to EID users
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.66 KB
- Format:
- Item-specific license agreed upon to submission
- Description: