Cache tag RAM having separate valid bit array with multiple step

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

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

711114, G06F 1212

Patent

active

057490902

ABSTRACT:
A cache TAG RAM (20) has a TAG array (22, 24) for storing TAG addresses of data stored in a cache memory, and a valid bit array (26, 31). In the cache TAG RAM (20), a valid bit is set for each TAG address to indicate if the TAG address is valid. The valid bit array (26, 31) is located separate from the TAG array (22, 24). During power-up of the cache TAG RAM (20), a multiple step invalidation cycle is used to sequentially invalidate groups of columns of the valid bit array (26, 31). The multiple step invalidation cycle reduces the peak current during an invalidation cycle, thus reducing metal migration.

REFERENCES:
patent: 4586133 (1986-04-01), Steckler
patent: 4809225 (1989-02-01), Dimmler et al.
patent: 4949308 (1990-08-01), Araki et al.
patent: 5060136 (1991-10-01), Furney et al.
patent: 5119485 (1992-06-01), Ledbetter, Jr. et al.
patent: 5212663 (1993-05-01), Leong
patent: 5283886 (1994-02-01), Nishii et al.
patent: 5371714 (1994-12-01), Matsuda et al.
patent: 5398204 (1995-03-01), Maruyama
patent: 5422856 (1995-06-01), Sasaki et al.
patent: 5479641 (1995-12-01), Nadir et al.

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 tag RAM having separate valid bit array with multiple step 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 tag RAM having separate valid bit array with multiple step, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cache tag RAM having separate valid bit array with multiple step will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-71717

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