发明名称 |
Hit-density-based replacement for data cache with prefetching |
摘要 |
A least recently used cache replacement system in which the data cache is logically partitioned into two separate sections, demand and prefetch. A cache directory table and a least recently used table are used to maintain the cache. When a new demand data page is added to the cache, a most recently used (MRU) pointer is updated and points to this new page. When a prefetch page is added to the cache, the least recently used pointer of the demand section is updated with its backward pointer pointing to this new page. A cache hit on a demand of prefetch page moves that page to the top of the least recently used table. When a free page is needed in the cache, it is selected from the demand or prefetch sections of the memory based on a comparison of the demand hit density and the prefetch hit density so to maintain a balance between these two hit densities.
|
申请公布号 |
US5293609(A) |
申请公布日期 |
1994.03.08 |
申请号 |
US19910688732 |
申请日期 |
1991.04.19 |
申请人 |
INTERNATIONAL BUSINESS MACHINES CORPORATION |
发明人 |
SHIH, FENG-HSIEN W.;MACON, JR., JAMES F.;ONG, SHAUCHI |
分类号 |
G06F12/08;G06F12/12;(IPC1-7):G06F12/12 |
主分类号 |
G06F12/08 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|