Patent DE428854C successfully refreshed from Google Patents.
Patent US5522056A successfully refreshed from Google Patents.
US5522056A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Cache memory with plurality of congruence sets and sense amplifiers shared among the congruence sets
Assignee: Mitsubishi Electric Corp
•
Filing: 1993-08-03
•
Granted: 1996-05-28
•
Expires: 2013-08-03
Abstract
Abstract A cache memory with a data memory divided into a plurality of word arrays, each of which is selectable by a word select indicator. Each word array is further divided into a plurality of bit arrays, each of which correspond to a bit of a word, and include congruence set memories for each congruence set. A bit array is connected to a sense amplifier via a congruence set selector, thereby one set of congruence set memories of the word arrays in the data memory is selected, and one congruence set memory is selected from each of the bit arrays by a congruence set selector to be connected with a sense amplifier, so that only one sense amplifier has to be provided for each bit in each word in an entry of the data memory, thus eliminating the need to increase the number sense amplifiers as the number of congruence sets increases. Furthermore, as only the sense amplifier associated with the selected word array is operational, current consumption is reduced.
Inventors
- 👤 Tetsuya Watanabe
- 👤 Akira Yamada
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 17:01
CPC Classifications
G; G06; G06F; G06F12/00; G06F12/02; G06F12/08; G06F12/0802; G06F12/0864
Claims Analysis
Total Claims: 6
Claim 1
Independent Claim
362 words
A set-associative cache memory, wherein an address comprising an address tag, a congruence class address, and a word select indicator are input to the set-associative cache memory, wherein a data word is output in response to the input address, and wherein the set-associative cache memory uses a set of N congruence classes to store up to N data words for each combination of a congruence class address and a word selected by the word select indicator, the set-associative cache memory comprising: an address tag memory, coupled to receive the congruence class address, which outputs up to N address tag entries for an address tag memory entry addressed by said congruence class address; a comparator, coupled to said address tag memory and coupled to receive the address tag, which compares the address tag with said up to N address tag entries and outputs a congruence set selecting signal specifying which, if any, of said N address tag entries match the address tag; a data memory, coupled to receive the congruence class address and the word select indicator, said data memory comprising a plurality of word arrays, which each comprise a plurality of bit arrays, where a bit array comprises N congruence set memories, each comprising M bit entries addressable by the congruence class address, wherein said data memory outputs a data bit from a bit entry addressed by the congruence class address for each of said N congruence set memories of said plurality of bit arrays in a word array selected by the word select indicator; a congruence set selector, coupled to said comparator and coupled to said data memory, which inputs data bits output by said data memory and outputs those of said data bits input to said congruence set selector which are output from congruence set memories selected by said congruence set selecting signal; and a plurality of sense amplifiers, each coupled to a bit output of said congruence set selector to receive selected congruence set signals, wherein each of said plurality of said sense amplifiers amplifies and outputs a bit value of said congruence set signals, thereby using only one sense amplifier for each of said N congruence set memories.
Claim 2
Dependent Claim
362 words
A set-associative cache memory, wherein an address comprising an address tag, a congruence class address, and a word select indicator are input to the set-associative cache memory, wherein a data word is output in response to the input address, and wherein the set-associative cache memory uses a set of N congruence classes to store up to N data words for each combination of a congruence class address and a word selected by the word select indicator, the set-associative cache memory comprising: an address tag memory, coupled to receive the congruence class address, which outputs up to N address tag entries for an address tag memory entry addressed by said congruence class address; a comparator, coupled to said address tag memory and coupled to receive the address tag, which compares the address tag with said up to N address tag entries and outputs a congruence set selecting signal specifying which, if any, of said N address tag entries match the address tag; a data memory, coupled to receive the congruence class address and the word select indicator, said data memory comprising a plurality of word arrays, which each comprise a plurality of bit arrays, where a bit array comprises N congruence set memories, each comprising M bit entries addressable by the congruence class address, wherein said data memory outputs a data bit from a bit entry addressed by the congruence class address for each of said N congruence set memories of said plurality of bit arrays in a word array selected by the word select indicator; a congruence set selector, coupled to said comparator and coupled to said data memory, which inputs data bits output by said data memory and outputs those of said data bits input to said congruence set selector which are output from congruence set memories selected by said congruence set selecting signal; and a plurality of sense amplifiers, each coupled to a bit output of said congruence set selector to receive selected congruence set signals, wherein each of said plurality of said sense amplifiers amplifies and outputs a bit value of said congruence set signals, thereby using only one sense amplifier for each of said N congruence set memories.
Claim 3
Dependent Claim
84 words
A set-associative cache memory as set forth in claim 1, further comprising: a plurality of writing means, coupled to said congruence set selector, for writing data to each of said plurality of bit arrays of said data memory via said congruence set selector, wherein said plurality of writing means rewrite each bit entry in congruence set memories selected by said congruence set selecting signal; and means, coupled to said congruence set selector, for selecting all N congruence set memories of each bit array simultaneously.
Claim 4
Dependent Claim
34 words
A set-associative cache memory as set forth in claim 1, wherein said congruence set selecting signal selects no more than one congruence set selection at any time when outputting data from said data memory.
Claim 5
Dependent Claim
41 words
A set-associative cache memory as set forth in claim 1, wherein each of said plurality of sense amplifiers coupled to bit outputs of word arrays not selected by the word select indicator are disabled when outputting data from said data memory.
Claim 6
Dependent Claim
49 words
A set-associative cache memory as set forth in claim 1, comprising four word arrays, thirty-two bit arrays per word array, and wherein N, the number of congruence sets, is four, and the number of bit entries per congruence set in a bit array, M, is a power of two.
References Cited (Backward Citations)
US4513367A
Cited
US4463420A
Cited
US5133061A
Cited
US4905188A
Cited
US5091851A
Cited
US5014195A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-05-28 | 1999-11-27 | 2000-05-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-05-28 | 2003-11-27 | 2004-05-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-05-28 | 2007-11-27 | 2008-05-28 | $7700.00 | Window Closed / Lapsed |