Computer system which uses a least-recently-used algorithm for manipulating data tags when performing cache replacement
作者： Saied Zangenehpour
DOI:
关键词:
摘要: The invention is an improved method of implementing the "least-recently-used" (LRU) replacement algorithm in a cache memory. Each data block memory numbered with priority tag ranging from 0 to number blocks lowest always replaced first. just given highest and one subtracted each other tag. When requested found cache, greater than
lens.org 参考文章(22)
Vincent A. Cordi, Ted Y. Nickel, Implementation of the least recently used (lru) algorithm using magnetic bubble domains ,(1972)
Douglas R. Kraft, Edgar R. Goodrich, Method and apparatus for implementing an algorithm associated with stored information ,(1983)
Jonathan E. Steinhart, Method and apparatus for storing and updating user entered command strings for use with otherwise unassigned softkeys ,(1983)
Clarence W. DeKarske, Paired least recently used block replacement system ,(1978)
Arnold Weinberger, Louis R. Bryant, Raymond J. Pedersen, Circuit for implementing a modified lru replacement algorithm for a cache ,(1975)
Patricia L. Roddy, David L. Flower, Charles W. Skelton, David S. Laffitte, Microcomputer having ROM mass memory for downloading main RAM memory with microcomputer instructions ,(1980)
Didier Giroir, Gerard Lacoste, Arbitration method and device for allocating a shared resource in a data processing system ,(1984)
Shih-Jeh Chang, Cache memory using a lowest priority replacement circuit ,(1982)
Andrew B. McNeill, Gerald A. Marazas, Gerald U. Merckel, Jerry D. Dixon, Automatic adjustment of the quantity of prefetch data in a disk cache operation ,(1981)
Watson M. Conner, Douglas R. Case, Cache-effective sort string generation method ,(1985)