BitValue Inference: Detecting and Exploiting Narrow Bitwidth Computations

  • Authors:
  • Mihai Budiu;Majd Sakr;Kip Walker;Seth Copen Goldstein

  • Affiliations:
  • -;-;-;-

  • Venue:
  • Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
  • Year:
  • 2000

Quantified Score

Hi-index 0.01

Visualization

Abstract

We present a compiler algorithm called BitValue, which can discover both unused and constant bits in dusty-deck C programs. Bit-Value uses forward and backward dataflow analyses, generalizing constant-folding 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% oft he 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.