BitValue Inference: Detecting and Exploiting Narrow Bitwidth Computations

DMCA

BitValue Inference: Detecting and Exploiting Narrow Bitwidth Computations (2000)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Mihai Budiu , Seth Copen Goldstein

Venue:	IN PROCEEDINGS OF THE EUROPAR 2000 EUROPEAN CONFERENCE ON PARALLEL COMPUTING
Citations:	56 - 11 self

BibTeX

@INPROCEEDINGS{Budiu00bitvalueinference:,
    author = {Mihai Budiu and Seth Copen Goldstein},
    title = {BitValue Inference: Detecting and Exploiting Narrow Bitwidth Computations},
    booktitle = {IN PROCEEDINGS OF THE EUROPAR 2000 EUROPEAN CONFERENCE ON PARALLEL COMPUTING},
    year = {2000},
    pages = {969--979},
    publisher = {Springer Verlag}
}

OpenURL

Abstract

We present a compiler algorithm called BitValue, which can discover unused and constant bits in dusty-deck C programs. BitValue uses forward and backward dataflow analyses, generalizing constant-folding and dead-code detection at the bit-level. This algorithm enables compiler optimizations targeting special processor architectures for computing on non-standard bitwidths. Using this algorithm we show that up to 36% of the computed bytes are thrown away; also, we show that on average 26.8% of the values computed require 16 bits or less (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.

Keyphrases

bitvalue inference exploiting narrow bitwidth computation compiler algorithm dusty-deck program non-standard bitwidths reconfigurable hardware constant bit special processor architecture substantial reduction dataflow analysis dead-code detection synthesized circuit compiler optimization

DMCA