Second chance replacement mechanism for a highly associative...

Details Second chance replacement mechanism for a highly associative... Second chance replacement mechanism for a highly associative...

2007-09-04

2010-12-28

Ellis, Kevin L (Department: 2187)

Electrical computers and digital processing systems: memory

Storage accessing and control

Hierarchical memories

C711S128000, C711S133000, C711S144000, C711S159000, C711S160000

Reexamination Certificate

active

07861041

ABSTRACT:
A cache memory system includes a cache memory and a block replacement controller. The cache memory may include a plurality of sets, each set including a plurality of block storage locations. The block replacement controller may maintain a separate count value corresponding to each set of the cache memory. The separate count value points to an eligible block storage location within the given set to store replacement data. The block replacement controller may maintain for each of at least some of the block storage locations, an associated recent access bit indicative of whether the corresponding block storage location was recently accessed. In addition, the block replacement controller may store the replacement data within the eligible block storage location pointed to by the separate count value depending upon whether a particular recent access bit indicates that the eligible block storage location was recently accessed.

REFERENCES:
patent: 6243791 (2001-06-01), Vondran, Jr.
patent: 6490656 (2002-12-01), Carlson
patent: 6732238 (2004-05-01), Evans et al.
patent: 6823427 (2004-11-01), Sander
patent: 2005/0223173 (2005-10-01), Yamazaki
International Search Report in application No. PCT/US2008/010368 mailed Dec. 4, 2008.
“Replacement Algorithm for a Fully Associative Cache;” IBM Technical Disclosure Bulletin, IBM Corp., New York, NY; vol. 41, No. 1, Jan. 1, 1998; pp. 123-124.
Wezenbeek, et al; “A Survey of Memory Management;” Microprocessing and Microprogramming, Elsevier Science Publishers, BV., Amsterdam, NL; vol. 36, No. 3, May 1, 1993, pp. 141-162.
Soundararajan, “Implementing a Better Cache Replacement Algorithm in Apache Derby Progress Report”, Internet, Aug. 19, 2006, http://www.eecg.toronto.edu/˜gokul/derby/derby-report-aug-19-2006.pdf.

Affiliated with

Also associated with

Rating

Second chance replacement mechanism for a highly associative... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Second chance replacement mechanism for a highly associative..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Second chance replacement mechanism for a highly associative... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4229644