Cache memory for identifying locked and least recently used...

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, C711S145000, C711S152000, C711S156000, C711S159000

Reexamination Certificate

active

06904501

ABSTRACT:
A cache memory includes a plurality of data memory blocks and a code memory block. Each data memory block has a plurality of storage locations and has a particular storage location identified by a same index value. The code memory block has a plurality of code values with a particular code value being associated with the same index value. The particular code value is operable to identify which ones of the particular storage locations associated with the same index value are locked to prevent alteration of contents therein. The particular code value is also operable to identify which particular storage location has been most recently used and which particular storage location has been least recently used of the particular storage locations associated with the same index value.

REFERENCES:
patent: 5353425 (1994-10-01), Malamy et al.
patent: 5493667 (1996-02-01), Huck et al.
patent: 5974508 (1999-10-01), Maheshwari
patent: 6134636 (2000-10-01), Mathews et al.
patent: 6584547 (2003-06-01), Palanca et al.
patent: 6643737 (2003-11-01), Ono
patent: 2003/0070047 (2003-04-01), Dwyer et al.
patent: 2003/0204677 (2003-10-01), Bergsten
“Pre-Fetching with the Segmented LRU Algorithm,” Pendse et al, Circuits and Systems, 1999. 42nd Midwest Symposium on, vol. 2, Aug. 11, 1999. pp. 862-865.
“LRU-SP: a size-adjusted and popularity-aware LRU replacement algorithm for web caching,” Leff et al. Computer Software a Applications Conference, 2000. COMPSAC 2000. The Annual International, Oct. 25-27, 2000. pp. 48-53.

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 memory for identifying locked and least recently used... 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 memory for identifying locked and least recently used..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cache memory for identifying locked and least recently used... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3504875

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