• DocumentCode
    356249
  • Title

    Selective prefetching: prefetching when only required

  • Author

    Pendse, Ravi ; Katta, H.

  • Author_Institution
    Dept. of Electr. Eng., Wichita State Univ., KS, USA
  • Volume
    2
  • fYear
    1999
  • fDate
    1999
  • Firstpage
    866
  • Abstract
    Cache memories are commonly used to reduce the number of slower lower-level memory accesses, thereby improving the memory hierarchy performance. However, high cache miss-ratio can severely degrade system performance. It is therefore necessary to anticipate the cache misses to reduce their frequency. Prefetching, is one such technique, which allows memory systems to import data into the cache before the processor needs it. Aggressive prefetching can significantly reduce cache misses but may lead to cache pollution and also increase memory traffic. An innovative hardware-based prefetching technique is proposed which overcomes these problems while providing improved cache hit-rate. Our trace driven simulations show an improvement of around 60% in the miss rates for an instruction cache employing the LRU-FP block replacement algorithm with the proposed pre-fetch scheme as compared to the miss rates obtained due to a sequential prefetch mechanism
  • Keywords
    cache storage; memory architecture; LRU-FP block replacement algorithm; cache hit-rate; cache memories; cache pollution; memory hierarchy performance; memory traffic; miss-ratio; selective prefetching; Cache memory; Degradation; Delay; Floods; Frequency; Hardware; Pollution; Prefetching; Random access memory; System performance;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 1999. 42nd Midwest Symposium on
  • Conference_Location
    Las Cruces, NM
  • Print_ISBN
    0-7803-5491-5
  • Type

    conf

  • DOI
    10.1109/MWSCAS.1999.867772
  • Filename
    867772