Cache residence prediction

Details Cache residence prediction Cache residence prediction

2011-03-08

2011-03-08

Nguyen, Hiep T (Department: 2187)

Electrical computers and digital processing systems: memory

Storage accessing and control

Hierarchical memories

Reexamination Certificate

active

07904657

ABSTRACT:
The present invention proposes a novel cache residence prediction mechanism that predicts whether requested data of a cache miss can be found in another cache. The memory controller can use the prediction result to determine if it should immediately initiate a memory access, or initiate no memory access until a cache snoop response shows that the requested data cannot be supplied by a cache.The cache residence prediction mechanism can be implemented at the cache side, the memory side, or both. A cache-side prediction mechanism can predict that data requested by a cache miss can be found in another cache if the cache miss address matches an address tag of a cache line in the requesting cache and the cache line is in an invalid state. A memory-side prediction mechanism can make effective prediction based on observed memory and cache operations that are recorded in a prediction table.

REFERENCES:
patent: 5944780 (1999-08-01), Chase et al.
patent: 5966737 (1999-10-01), Steely, Jr. et al.
patent: 6138209 (2000-10-01), Krolak et al.
patent: 6192449 (2001-02-01), Circello et al.
patent: 6349368 (2002-02-01), Arimilli et al.
patent: 6405289 (2002-06-01), Arimilli et al.
patent: 6418525 (2002-07-01), Charney et al.
patent: 6425076 (2002-07-01), Killian
patent: 6571322 (2003-05-01), Arimilli et al.
patent: 6587931 (2003-07-01), Bauman et al.
patent: 7266642 (2007-09-01), Shen et al.
patent: 2002/0144063 (2002-10-01), Peir et al.
patent: 2003/0005036 (2003-01-01), Metzenmacher
patent: 5-158793 (1993-06-01), None
patent: 2001-92801 (2001-04-01), None
Sean C. Rhea et al., “Probabilistic Location and Routing” pp. 1-11, INFOCOM 2002.
Antonio Gonzalez, et al., “A Data Cache With Multiple Caching Strategies Tunned to Different Types of Locality”.
Manuel E. Acacio, et al., “The Use of Prediction for Accelerating Upgrade Misses in CC-NUMA Multiprocessors”.
Jih-Kwon Peir, et al., “Bloom Filtering Cache Misses for Accurate Data Speculation and Prefetching” ICS'02, Jun. 22-26, 2002, New York, New York, USA.
Nancy M. Amato, et al., “Predicting Performance on SMPs” Department of Computer Science Texas A & M University, Oct. 4, 1999.
Michael Mitzenmacher, “Compressed Bloom Filters”.

Affiliated with

Also associated with

Rating

Cache residence prediction does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Cache residence prediction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cache residence prediction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2655850