Cache allocation mechanism for saving multiple elected...

Electrical computers and digital processing systems: memory – Storage accessing and control – Hierarchical memories

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C711S136000

Reexamination Certificate

active

06996679

ABSTRACT:
A method and apparatus in a data processing system for protecting against displacement of two types of cache lines using a least recently used cache management process. A first member in a class of cache lines is selected as a first substitute victim. The first substitute victim is unselectable by the least recently used cache management process, and the second substitute victim is associated with a selected member in the class of cache lines. A second member in the class of cache lines is selected as a second substitute victim. The second victim is unselectable by the least recently used cache management process, and the second substitute victim is associated with the selected member in the class of cache lines. One of the first or second substitute victims are replaced in response to a selection of the selected member as a victim when a cache miss occurs, wherein the selected member remains in the class of cache lines.

REFERENCES:
patent: 5900011 (1999-05-01), Saulsbury et al.
patent: 5974507 (1999-10-01), Arimilli et al.
patent: 6145057 (2000-11-01), Arimilli et al.
patent: 6345339 (2002-02-01), Arimilli et al.
patent: 6408362 (2002-06-01), Arimilli et al.
patent: 2004/0073760 (2004-04-01), Arimilli et al.
Starke, Cache Allocation Mechanism for Saving Elected Unworthy Member via Substitute Victimization and Imputed Worthiness of Substitute Victim Member.
Arimilli et al., Programming Means for Dynamic Specification of Cache Management Preferences.
Cargnoni et al, Cache Allocation Mechanism For Biasing Subsequent Allocations Based Upon Directory State.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Cache allocation mechanism for saving multiple elected... 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 allocation mechanism for saving multiple elected..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cache allocation mechanism for saving multiple elected... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3705997

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.