Skip to main content

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 152))

Abstract

Cache miss rate reduction represents the classical approach to improving cache performance. On method to reduce cache miss rate is higher associativity cache. In this paper we introduce a novel method to enhance cache performance by dynamically choosing the best associativity that can be used to reduce cache miss rate depending on the running program needs. According to our approach cache can be move from direct mapped to 8-way associative online without the need to perform complex address mapping.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Hennessy JL, Patterson DA (2003) Computer architecture: a quantitative approach. Morgan Kaufmann Publishers, San Fransisco

    Google Scholar 

  2. Kharbutli M, Irwin K, Solihin Y, Lee J (2011) Using prime numbers for cache indexing to eliminate conflict misses. This work was supported in part by North Carolina State University, Seoul National University, the Korean Ministry of Education under the BK21 program, and the Korean Ministry of Science and Technology under the National Research Laboratory program

    Google Scholar 

  3. Kharbutli M, Solihin Y (2008) Counter-based cache replacement and bypassing algorithms, IEEE Trans Comput 57(4):433–447

    Google Scholar 

  4. Ghasemzadeh H, Mazrouee S, Moghaddam HG, Shojaei H, Kakoee MR (2006) Hardware implementation of stack-based replacement algorithms. In: Proceedings of world academy of science, engineering and technology, vol 16

    Google Scholar 

  5. Beyls K, D’Hollander EH (2008) Refactoring intermediately executed code to reduce cache capacity misses. J Instr Lev Parallelism 10:1–9 (Submitted 10/06; published 6/08). This article initially appeared in abbreviated form in ACM computing frontiers 2006

    Google Scholar 

  6. Solihin Y, Lee J, Torrellas J (2003) Correlation prefetching with a user-level memory thread. In: IEEE Trans Parallel Distributed Syst 14(6):563–580

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mazen AbuZaher .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this paper

Cite this paper

AbuZaher, M., Alayoubi, B., Alefeshat, B., Mesleh, A. (2013). Dynamic Cache Miss-Rate Reduction. In: Elleithy, K., Sobh, T. (eds) Innovations and Advances in Computer, Information, Systems Sciences, and Engineering. Lecture Notes in Electrical Engineering, vol 152. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-3535-8_16

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-3535-8_16

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-3534-1

  • Online ISBN: 978-1-4614-3535-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics