发明名称 LEAST-RECENTLY-USED (LRU) TO FIRST-DIRTY-MEMBER DISTANCE-MAINTAINING CACHE CLEANING SCHEDULER
摘要 A technique for scheduling cache cleaning operations maintains a clean distance between a set of least-recently-used (LRU) clean lines and the LRU dirty (modified) line for each congruence class in the cache. The technique is generally employed at a victim cache at the highest-order level of the cache memory hierarchy, so that write-backs to system memory are scheduled to avoid having to generate a write-back in response to a cache miss in the next lower-order level of the cache memory hierarchy. The clean distance can be determined by counting all of the LRU clean lines in each congruence class that have a reference count that is less than or equal to the reference count of the LRU dirty line.
申请公布号 US2014372705(A1) 申请公布日期 2014.12.18
申请号 US201314033726 申请日期 2013.09.23
申请人 INTERNATIONAL BUSINESS MACHINES CORPORATION 发明人 Goodman Benjiman L.;Joyner Jody B.;Powell Stephen J.;Sawdey Aaron C.;Stuecheli Jeffrey A.
分类号 G06F12/08 主分类号 G06F12/08
代理机构 代理人
主权项 1. A method of scheduling cache write-back operations, the method comprising: for each congruence class of a cache memory, determining an indication of a number of line allocations that can be supported by the current state of the congruence class without causing a write-back of a dirty line; comparing the indication to a specified clean distance value to determine when to schedule write-backs of dirty lines of the cache memory; responsive to the comparing determining that write-backs should be scheduled, scheduling the write-backs of one or more of the dirty lines.
地址 Armonk NY US