Cache Replacement Policy
作者： Giora Biran , Brian Bass , Hubertus Franke , Amit Golander , Hao Yu
DOI:
关键词:
摘要: Techniques for replacing one or more blocks in a cache, the being associated with plurality of data streams, are provided. The cache grouped into groups. Each group corresponding to streams. One incoming received. To free space, groups invalidated accordance at least an inactivity given stream and length stored cache. A number streams maintained within is maximized.
lens.org 参考文章(20)
Erik Hagersten, Method for increasing the speed of data processing in a computer system ,(1998)
Peter Geiger, J. Alvarez Ii Manuel, Thomas A. Dye, Memory module including scalable embedded parallel data compression and decompression engines ,(2000)
Hemant G. Rotithor, Randy B. Osborne, Donald W. McCauley, High performance memory device-state aware chipset prefetcher ,(2002)
Siamack Nemazie, Mehdi Asnaashari, Alan Chen, Dale P. Mcnamara, Memory block selection ,(2010)
Francis A. Kampf, Method and system for improving lossless compression efficiency ,(2002)
Luis Paris, High-speed data compression based on set associative cache mapping techniques ,(2007)
Michael Wintergerst, Petio G. Petev, Size based eviction implementation ,(2004)
Bradford Congdon, Sivakumar Radhakrishnan, Hui Lu, Kenneth Creta, Chitra Natarajan, Cache usage for concurrent multiple streams ,(2003)
Michael Thomas Benhase, Brent Cameron Beardsley, Robert Louis Morton, Douglas A. Martin, Mark A. Reid, Method and system for managing data in cache using multiple data structures ,(1998)
Yaron Revah, Haim Helman, Shemer Schwartz, Ofir Zohar, Dror Cohen, Method and apparatus for managing a cache memory in a mass-storage system ,(2005)