iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://unpaywall.org/10.1007/11599555_36
Dynamic Co-allocation of Level One Caches | SpringerLink
Skip to main content

Dynamic Co-allocation of Level One Caches

  • Conference paper
Embedded Software and Systems (ICESS 2005)

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

Included in the following conference series:

Abstract

The effectiveness of level one (L1) caches is of great importance to the processor performance. We have observed that programs exhibit varying demands in the L1 instruction cache (I-cache) and data cache (D-cache) during execution, and such demands are notably different across programs. We propose to co-allocate the cache ways between the I- and D-cache in responses to the program’s need on-the-fly. Resources are re-allocated based on the potential performance benefit. Using this scheme, a 32KB co-allocation L1 can gain 10% performance improvement on average, which is comparable to a 64KB traditional L1.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Alameldeen, A., Wood, D.: Adaptive cache compression for high-performance processors. In: ISCA, pp. 212–223 (2004)

    Google Scholar 

  2. Balasubramonian, R., Albonesi, D., Buyuktosunoglu, A., Dwarkadas, S.: Memory Hierarchy Reconfiguration for Energy and Performance in General-Purpose Processor Architectures. In: Micro, pp. 245–257 (2000)

    Google Scholar 

  3. Burger, D., Austin, T.: The SimpleScalar Tool Set, Version 2.0. Technical Report 1342, Univ. of Wisconsin-Madison, Comp. Sci. Dept. (1997)

    Google Scholar 

  4. Denning, P.: The working set model for program behavior. Communications of the ACM 11(5), 323–333 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  5. Drach, N., Seznec, A.: Semi-unified caches. In: ICPP, pp. 25–28 (1993)

    Google Scholar 

  6. Karkhanis, T., Smith, J.: A first-order superscalar processor model. In: ISCA, pp. 338–349 (2004)

    Google Scholar 

  7. Kharbutli, M., Irwin, K., Solihin, Y., Lee, J.: Using prime numbers for cache indexing to eliminate conflict misses. In: HPCA, pp. 288–299 (2004)

    Google Scholar 

  8. Nesbit, K.J., Smith, J.E.: Data cache prefetching using a global history buffer. In: HPCA, pp. 96–105 (2004)

    Google Scholar 

  9. Ranganathan, P., Adve, S., Jouppi, N.: Reconfigurable caches and their application to media processing. In: ISCA, pp. 214–224 (2000)

    Google Scholar 

  10. Sherwood, T., Perelman, E., Hamerly, G., Calder, B.: Automatically Characterizing Large Scale Program Behavior. In: ASPLOS, pp. 45–57 (2002)

    Google Scholar 

  11. Shivakumar, P., Jouppi, N.P.: CACTI 3.0 An Integrated Cache Timing, Power, and Area Model. WRL Research Report (2001)

    Google Scholar 

  12. Suh, G.E., Devadas, S., Rudolph, L.: A new memory monitoring scheme for memory-aware scheduling and partitioning. In: HPCA, pp. 117–128 (2002)

    Google Scholar 

  13. Yang, J., Zhang, Y., Gupta, R.: Frequent value compression in data caches. In: MICRO, pp. 258–265 (2000)

    Google Scholar 

  14. Zhang, C., Vahid, F., Najjar, W.: A highly configurable cache architecture for embedded systems. In: ISCA, pp. 136–146 (2003)

    Google Scholar 

  15. Understanding the detailed architecture of the AMD’s 64 bit core, http://www.chip-architect.com/news/2003_09_21_Detailed_Architecture_of_AMDs_64bit_Core.html#3

  16. Intel, Intel Pentium III Processor for the SC242 at 450 MHz to 1.0 GHz Datasheet, http://www.intel.com/design/pentiumiii/datashts/244452.htm

  17. CPU Comparison, http://www.pantherproducts.co.uk/Articles/CPU/CPU%20Comparison.shtml

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jin, L., Wu, W., Yang, J., Zhang, C., Zhang, Y. (2005). Dynamic Co-allocation of Level One Caches. In: Yang, L.T., Zhou, X., Zhao, W., Wu, Z., Zhu, Y., Lin, M. (eds) Embedded Software and Systems. ICESS 2005. Lecture Notes in Computer Science, vol 3820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11599555_36

Download citation

  • DOI: https://doi.org/10.1007/11599555_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30881-2

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics