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.

• Type: Conference
• Year: 2000
• Where: EUROPAR
• Authors: Mihai Budiu, Majd Sakr, Kip Walker, Seth Copen Goldstein
• Keywords: Algorithm, Algorithm Called Bitvalue, Algorithm Enables Compiler, Distributed And Parallel Computing, EUROPAR 2000