Least-recently-used circuit
作者： Masayuki Hata , Akira Yamada
DOI:
关键词:
摘要: A least-recently-used (LRU) circuit determines a replaceable term needed for storing data newly loaded from cache memory example. The comprises recently-used information means relating to the top priority order or subordinative among plural terms, and determining which is in accordance with stored means. High speed processing thus possible by simplified logical construction. Also, provided control directly indirectly select predetermined term, situations where cannot properly determine top-priority term. Therefore, even when selected indirectly, can be securely prevented discontinuing its own functional operation.
google.de 参考文章(14)
Hidehiro Asai, Kenichi Echigoya, Cache memory system with improved re-writing address determination scheme involving history of use ,(1988)
Terutaka Tateishi, Masanori Takahashi, Error processing system using two different types of replace logic ,(1982)
Ikuo Yamada, Fault detection circuit capable of detecting burst errors in an LRU memory ,(1988)
Akira Hattori, Takamitsu Tsuchimoto, Data processing system having an intermediate buffer memory ,(1977)
Benedicto U. Messina, Daniel J. Coombes, Fault tolerant least recently used algorithm logic ,(1976)
Arnold Weinberger, Louis R. Bryant, Raymond J. Pedersen, Circuit for implementing a modified lru replacement algorithm for a cache ,(1975)
Thomas A. Northrup, Stephen R. Jenkins, Robert E. Stewart, Memory module with means for generating a control signal that inhibits a subsequent overlapped memory cycle during a reading operation portion of a reading memory cycle ,(1976)
Shih-Jeh Chang, Cache memory using a lowest priority replacement circuit ,(1982)
Ronald E. Lange, Richard J. Fisher, Cache memory utilizing selective clearing and least recently used updating ,(1980)
Masahiro Tada, Buffer storage control apparatus ,(1980)