Paired least recently used block replacement algorithm

Details Paired least recently used block replacement algorithm Paired least recently used block replacement algorithm

G - Physics

06

F

354/244

G06F 13/00 (2006.01) G06F 11/00 (2006.01) G06F 12/12 (2006.01) G11C 29/00 (2006.01)

Patent

CA 1120599

PAIRED LEAST RECENTLY USED BLOCK REPLACEMENT ALGORITHM ABSTRACT OF THE DISCLOSURE A set associative cache buffer organized with 2n blocks per set requires only 2n-1 age bits for determining the replacement block within a set. When the cache buffer is addressed and the data sought is not found therein, the age bits determine which block of data in the set should be replaced with new data from the main memory. The block replaced may be either the least recently used block or one of the two least recently used blocks. The replacement logic is such that the buffer may be expanded from two to four blocks per set with minimal impact on the replacement logic. In addition, provision is made for disabling faulty blocks thus allowing the cache buffer and main memory behind it to be utilized in a degraded mode.

336224

Affiliated with

Also associated with

Rating

Paired least recently used block replacement algorithm does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Paired least recently used block replacement algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Paired least recently used block replacement algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFCA-PAI-O-246921