Weighted cache line replacement
作者： Michael Wazlowski , John Robinson , Robert Tremaine
DOI:
关键词:
摘要: A method for selecting a line to replace in an inclusive set-associative cache memory system which is based on least recently used replacement policy but enhanced detect and give special treatment the reloading of that has been cast out. reloaded after having out assigned encoding temporarily gives priority so it will not be selected usual process. This selection improves performance by providing better hit rates hierarchy levels above, ensuring heavily lines above are aged below due lack use.
lens.org 参考文章(9)
James R. Macdonald, Programmable cache including a non-lockable data way and a lockable data way configured to lock real-time data ,(1997)
John A. Wickeraad, Stephen B. Lyle, Brendan A. Voge, Method and apparatus for replacing cache lines in a cache memory ,(1998)
Adam Malamy, Norman M. Hayes, Rajiv N. Patel, Methods and apparatus for implementing a pseudo-LRU cache memory replacement scheme with a locking feature ,(1993)
Yurij Andrij Baransky, Pratap Chandra Pattnaik, Orran Yaakov Krieger, Hubertus Franke, Cache architecture to enable accurate cache sensitivity ,(1998)
Kimming So, Hoichi Cheong, Dwain A. Hicks, Hierarchical cache arrangement wherein the replacement of an LRU entry in a second level cache is prevented when the cache entry is the only inclusive entry in the first level cache ,(1994)
James R. Macdonald, Real time interrupt handling for superscalar processors ,(1997)
David Scott Ray, David J. Shippy, Data streaming mechanism in a microprocessor ,(2002)
Randall D. Groves, II John T. O'Quin, Method and apparatus for internal cache copy ,(1995)