Caching associative memory using non-overlapping data

Details Caching associative memory using non-overlapping data Caching associative memory using non-overlapping data

2006-03-14

2006-03-14

Thai, Tuan V. (Department: 2186)

Electrical computers and digital processing systems: memory

Storage accessing and control

Hierarchical memories

C711S100000, C711S108000, C711S118000, C711S154000

Reexamination Certificate

active

07013367

ABSTRACT:
An apparatus and method for caching data in an associative memory cache using a single non-overlapping entry, wherein the non-overlapping entry is created from a matching entry and one or more overlapping entries that are stored in a primary associative memory.

REFERENCES:
patent: 4084225 (1978-04-01), Anderson et al.
patent: 5226005 (1993-07-01), Lee et al.
patent: 5283882 (1994-02-01), Smith et al.
patent: 5396470 (1995-03-01), Storn
patent: 5420993 (1995-05-01), Smith et al.
patent: 5438535 (1995-08-01), Lattibeaudiere
patent: 5502832 (1996-03-01), Ali-Yahia et al.
patent: 5999435 (1999-12-01), Henderson et al.
patent: 6175514 (2001-01-01), Henderson et al.
patent: 6362993 (2002-03-01), Henderson et al.
patent: 6378042 (2002-04-01), Henderson et al.
patent: 6426647 (2002-07-01), Henderson
patent: 6446188 (2002-09-01), Henderson et al.
patent: 6470436 (2002-10-01), Croft et al.
patent: 2003/0012198 (2003-01-01), Kaganoi et al.

Affiliated with

Also associated with

Rating

Caching associative memory using non-overlapping data does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Caching associative memory using non-overlapping data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Caching associative memory using non-overlapping data will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3603390