Sciweavers

EUROPAR
2000
Springer

BitValue Inference: Detecting and Exploiting Narrow Bitwidth Computations

14 years 4 months ago
BitValue Inference: Detecting and Exploiting Narrow Bitwidth Computations
We present a compiler algorithm called BitValue, which can discover both unused and constant bits in dusty-deck C programs. BitValue 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.
Mihai Budiu, Majd Sakr, Kip Walker, Seth Copen Gol
Added 24 Aug 2010
Updated 24 Aug 2010
Type Conference
Year 2000
Where EUROPAR
Authors Mihai Budiu, Majd Sakr, Kip Walker, Seth Copen Goldstein
Comments (0)