Skip to main content

Live Range Aware Cache Architecture

  • Conference paper
  • 644 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4186))

Abstract

Memory wall is always the focus of computer architecture research. In this paper, we observe that in computers with write-back cache, memory write operation actually lags behind write instruction commitment. By the time memory write operation executes, the data might already have gone out of its live range. Based on this observation, a novel Cache architecture called LIve Range Aware Cache (LIRAC) is proposed. LIRAC can significantly reduce the number of write operations with minimal hardware support. Performance benefits of LIRAC are evaluated by trace-based analysis using simplescalar simulator and SPEC CPU 2000 benchmarks. Our results show that LIRAC can eliminate 21% of write operations on average and up to 85% in the best case.

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. Franklin, M., Sohi, G.S.: Register Traffic Analysis for Streamlining Inter-Operation Communication in Fine-Grain Parallel Processors. In: Proceedings of 25th International Symposium on Microarchitecture, pp. 236–245 (1992)

    Google Scholar 

  2. Luis, A., Lozano, C., Guang, R.G.: Exploiting Short-Lived Variables in Superscalar Processors. In: Proceedings of 28th International Symposium on Microarchitecture, pp. 292–302 (1995)

    Google Scholar 

  3. Savransky, G., Ronen, R., Gonzalez, A.: A Power Aware Register Management Mechanism. International Journal of Parallel Programming 31(6), 451–467 (2003)

    Article  Google Scholar 

  4. Ponomarev, D., Kucuk, G., Ponomarev, Ergin, O., Ghose, K.: Isolating Short-Lived Operands for Energy Reduction. IEEE Transaction on Computers 53(6), 697–709 (2004)

    Article  Google Scholar 

  5. Martin, M.M., Roth, A., Fischer, C.N.: Exploiting Dead Value Information. In: Proceedings of 30th International Symposium on Microarchitecture, pp. 125–135 (1997)

    Google Scholar 

  6. Austin, T., Larson, E., Ernst, D.: SimpleScalar: An Infrastructure for Computer System Modeling. IEEE Computer 35(2), 59–67 (2002)

    Google Scholar 

  7. Edler, J., Hill, M.D.: Dinero IV Trace-Driven Uniprocessor Cache Simulator (2003), http://www.cs.wisc.edu/~markhill/DineroIV

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, P., Wang, D., Guo, S., Tian, T., Zheng, W. (2006). Live Range Aware Cache Architecture. In: Jesshope, C., Egan, C. (eds) Advances in Computer Systems Architecture. ACSAC 2006. Lecture Notes in Computer Science, vol 4186. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11859802_37

Download citation

  • DOI: https://doi.org/10.1007/11859802_37

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-40058-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics