首页>
外国专利>
System and method for hierarchical approximation of least recently used replacement algorithms within a cache organized as two or more super-ways of memory blocks
System and method for hierarchical approximation of least recently used replacement algorithms within a cache organized as two or more super-ways of memory blocks
展开▼
机译:用于在组织为两个或多个超级存储块的高速缓存中用于分层最近最少使用的替换算法的系统和方法
展开▼
页面导航
摘要
著录项
相似文献
摘要
A system for approximating a least recently used (LRU) algorithm for memory replacement in a cache memory. In one system example, the cache memory comprises memory blocks allocated into sets of N memory blocks. The N memory blocks are allocated as M super-ways of N/M memory blocks where N is greater than M. An index identifies the set of N memory blocks. A super-way hit/replacement tracking state machine tracks hits and replacements to each super-way and maintains state corresponding to an order of hits and replacements for each super-way where the super-ways are ordered from the MRU to the LRU. Storage for the state bits is associated with each index entry where the state bits include code bits associated with a memory block to be replaced within a LRU super-way. LRU logic is coupled to the super-way hit/replacement tracking state machine to select an LRU super-way as a function of the super-way hit and replacement history. Block selection logic then selects a memory block to be replaced within the LRU super-way as a function of predefined selection criteria.
展开▼