 |
|
|
|
|
|
 Title: |
US7058766:
Method and system of adaptive replacement cache with temporal filtering
[ Derwent Title ]
|
| Country: |
US United States of America
|
| |
| Inventor: |
Modha, Dharmendra S.; San Jose, CA, United States of America
|
| Assignee: |
International Business Machines Corporation, Armonk, NY, United States of America
other patents from INTERNATIONAL BUSINESS MACHINES CORPORATION (280070) (approx. 44,393)
News, Profiles, Stocks and More about this company
|
| Published / Filed: |
2006-06-06
/ 2003-10-21
|
| Application Number: |
US2003000690303
|
| IPC Code: |
Advanced:
G06F 12/00;
G06F 12/12;
Core:
more...
|
| ECLA Code: |
G06F12/12B4; G06F12/12B4B;
|
| U.S. Class: |
Current:
711/134;
711/118;
711/122;
711/133;
711/E12.072;
711/E12.073;
Original:
711/134;
711/134;
711/133;
711/118;
711/122;
|
| Field of Search: |
711/133,134
|
| Priority Number: |
| 2003-10-21 |
US2003000690303 |
|
| Abstract: |
A method for adaptively managing pages in a cache memory with a variable workload comprises defining a cache memory; organizing the cache into disjoint lists of pages, wherein the lists comprise lists T1, T2, B1, and B2; maintaining a bit that is set to either "S" or "L" for every page in the cache, which indicates whether the bit has short-term utility or long-term utility; ensuring that each member page of T1 is marked either as "S" or "L", wherein each member page of T1 and B1 is marked as "S" and each member page of T2 and B2 is marked as "L"; and maintaining a temporal locality window parameter such that pages that are re-requested within a window are of short-term utility and pages that are re-requested outside the window are of long-term utility, wherein the cache comprises pages that are members of any of lists T1 and T2.
|
| Attorney, Agent or Firm: |
Gibb I.P. Law Firm, LLC ;
McCabe, Esq., Mark C. ;
|
| Primary / Asst. Examiners: |
Padmanabhan, Mano; Patel, Kaushikkumar
|
| INPADOC Legal Status: |
Show legal status actions
Family Legal Status Report
|
| Family: |
Show 2 known family members
|
First Claim:
Show all 30 claims |
1. A method of adaptively managing pages in a cache memory with a variable workload, said method comprising: maintaining a bit that is set to either a first identifier or a second identifier for every page in the cache memory to indicate whether the bit has short-term utility or long-term utility; and adaptively varying a proportion of pages marked as said short-term utility and those marked as said long-term utility to increase a cache hit ratio of said cache memory.
|
| Background / Summary: |
Show background / summary
|
| Drawing Descriptions: |
Show drawing descriptions
|
| Description: |
Show description
|
|
|
|
|
|
|
| Foreign References: |
None
|
| Other References: |
Improving Disk Cache Hit-Ratios Through Cache Partitioning, Dominique et al. IEEE Log No. 9105059. Jan. 12, 1990.
LRU-SP: A size-Adjusted and Popularity-Aware LRU Replacement Algorithm for Web Caching, Kai et al. Graduate school of Informatics, Kyoto University. 0-7695-0792-1/00 copy right 2000 IEEE.
Reducing Cache Conflicts by Multi-level Cache Partitioning and Array Elements Mapping. Chih-Yung Chang, Dept. of Computer and Information Science, Aletheia University, 0-7695-0566-6/00 IEEE.
LRFU: A Spectrum of Policies that Subsumes the Least Recently Used and Least Frequently Used Policies, Donghee Lee et al. Mar. 10, 2000. IEEECS Log No. 111694.
ARC: A Self-Tuning,Low Overhead Replacement Cache, Megiddo et al. USENIX File & Storage Technologies Conference (FAST), Mar. 31, 2003.
|
| Continuity Data: |
| Application Number | Filed | Notes |
|---|
|
|
US2003000690303 | 2003-10-21 | is a
related to the prior publication |
| |
US20050086436A1 issued 2005-04-21 Method and system of adaptive replacement cache with temporal filtering
|
|
|
|
 Nominate this for the Gallery...
|
|
