Multi-index multi-way set-associative cache

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G06F 1300

Patent

active

055091350

ABSTRACT:
A plurality of indexes are provided for a multi-way set-associate cache of a computer system. The cache is organized as a plurality of blocks for storing data which are a copies of main memory data. Each block has an associated tag for uniquely identifying the block. The blocks and the tags are addressed by indexes. The indexes are generated by a Boolean hashing function which converts a memory address to cache indexes by combining the bits of the memory address using an exclusive OR function. Different combination of bits are used to generate a plurality of different indexes to address the tags and the associated blocks to transfer data between the cache and the central processing unit of the computer system.

REFERENCES:
patent: 4860199 (1989-08-01), Langendorf et al.
patent: 4942520 (1990-07-01), Langendorf
patent: 5014195 (1991-05-01), Farrell et al.
patent: 5067078 (1991-11-01), Telgam et al.
patent: 5091851 (1992-02-01), Shelton et al.
patent: 5133061 (1992-07-01), Melton et al.
patent: 5136700 (1992-08-01), Thacker
patent: 5155832 (1992-10-01), Hunt
patent: 5182799 (1993-01-01), Tamura et al.
Liu-Xor Randomiztion in Cache Congruence Class Indexing IBM Technical Disclosure Bulletin-vol. 27, No. 2. Jul. 1984.

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

Multi-index multi-way set-associative cache does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Multi-index multi-way set-associative cache, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multi-index multi-way set-associative cache will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-332320

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