Skip to main content

On Availability of Bit-Narrow Operations in General-Purpose Applications

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1896))

Abstract

Program instructions that consume and produce small operands can be executed in hardware circuitry of less than full size. We compare different proposed models of accounting for the usefulness of bit-positions in operands, using a run-time profiling tool, both to observe and summarize operand values, and to reconstruct and analyze the program’s data-flow graph to discover useless bits.We find that under aggressive models, the average number of useful bits per integer operand is as low as 10, not only in kernels but also in general-purpose applications from SPEC95.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Razdan. PRISC: Programmable Reduced Instruction Set Computers. PhD thesis, Harvard University, Cambridge, Massachusetts, 1994.

    Google Scholar 

  2. R. Razdan and M. D. Smith. A high-performance microarchitecture with hardware-programmable functional units. In Micro-27, Nov. 1994.

    Google Scholar 

  3. R. Razdan, K. Brace, and M. D. Smith. PRISC software acceleration techniques. In Proc. Int’l Conf. on Computer Design, pages 145–149, Oct. 1994.

    Google Scholar 

  4. M. Stephenson, J. Babb, and S. Amarasinghe. Bitwidth analysis with application to silicon compilation. In PLDI 2000, Vancouver, BC, June 2000.

    Google Scholar 

  5. M. Budiu, S. C. Goldstein, M. Sakr, and K. Walker. BitValue inference: Detecting exploiting narrow bitwidth computations. In EuroPar 2000, Munich, Germany, 2000.

    Google Scholar 

  6. M. W. Hall, J. M. Anderson, S. P. Amarasinghe, B. R. Murphy, S.-W. Liao, E. Bugnion, and M. S. Lam. Maximizing multiprocessor performance with the SUIF compiler. IEEE Computer, Dec. 1996.

    Google Scholar 

  7. J. Babb, M. Rinard, A. Moritz, W. Lee, M. Frank, R. Barua, and S. Amarasinghe. Parallelizing applications into silicon. In FCCM’ 99, Napa Valley, CA, Apr. 1999.

    Google Scholar 

  8. D. Brooks and M. Martonosi. Dynamically exploiting narrow width operands to improve processor power and performance. In 5th HPCA, Jan. 1999.

    Google Scholar 

  9. D. Burger and T. M. Austin. The SimpleScalar tool set, version 2.0. Computer Architecture News, pages 13–25, June 1997.

    Google Scholar 

  10. S. Kumar. Benchmarking tools and assessment environment for configurable computing. Submitted by Honeywell Technology Center to USA Intelligence Center and Fort Huachuca under Contract No. DABT63-96-C-0085, Sept. 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stefanović, D., Martonosi, M. (2000). On Availability of Bit-Narrow Operations in General-Purpose Applications. In: Hartenstein, R.W., Grünbacher, H. (eds) Field-Programmable Logic and Applications: The Roadmap to Reconfigurable Computing. FPL 2000. Lecture Notes in Computer Science, vol 1896. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44614-1_44

Download citation

  • DOI: https://doi.org/10.1007/3-540-44614-1_44

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67899-1

  • Online ISBN: 978-3-540-44614-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics