Publication Type |
poster |
School or College |
College of Engineering |
Department |
School of Computing |
Creator |
Chen, Yang; Regehr, John |
Title |
A code size microbenchmark for C |
Description |
Motivation ? No compilers could always generate smaller code than others ? Hand-optimized code is often hard to understand ? Programmers tend to write readable code and trust compilers generate fast and compact code for them ? There is a plenty of room for improving compiler optimizations Our goal: help compiler developers improve their products by giving them actionable test cases that pinpoint missed optimizations Reality to Compilers ? Compilers need trade off between the degree of optimizations and the amount of time spent in optimizing code ? Compilers suffer phase-ordering problems where the quality of generated code depends on the order of executed optimizations ? Compilers have to balance the machine-dependent and machine-independent features |
Type |
Text; Image |
Publisher |
University of Utah |
Language |
eng |
Bibliographic Citation |
Chen, Y., & Regehr, J. (2010). A code size microbenchmark for C. University of Utah. |
Rights Management |
(c)Yang Chen, John Regehr |
Format Medium |
application/pdf |
Format Extent |
174,007 bytes |
Identifier |
ir-main/14956 |
ARK |
ark:/87278/s62v30v3 |
Setname |
ir_uspace |
ID |
707798 |
Reference URL |
https://collections.lib.utah.edu/ark:/87278/s62v30v3 |