We present a compiler algorithm called Bit Value, which can discover both unused and constant bits in dusty-deck C programs. Bit- Value uses forward and backward dataflow analyses, generalizing constantfolding and dead-code detection at the bit-level. This algorithm enables compiler optimizations which target special processor architectures for computing on non-standard bitwidths. Using this algorithm we show that up to 31% of the computed bytes are thrown away (for programs from SpecINT95 and Mediabench). A compiler for reconfigurable hardware uses this algorithm to achieve substantial reductions (up to 20-fold) in the size of the synthesized circuits.
CITATION STYLE
Budiu, M., Sakr, M., Walker, K., & Goldstein, S. C. (2000). Bitvalue inference: Detecting and exploiting narrow bitwidth computations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1900, pp. 969–979). Springer Verlag. https://doi.org/10.1007/3-540-44520-x_137
Mendeley helps you to discover research relevant for your work.