Patent US5551004A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5551004A Expired / Lapsed US ⏱️ 0.0 years remaining

Structure which renders faulty data of a cache memory uncacheable in order that a partially functional cache memory may be utilized

Assignee: STMicroelectronics lnc USA
•
Filing: 1993-05-28
•
Granted: 1996-08-27
•
Expires: 2013-05-28
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract According to the present invention, faulty isolated bits in the cache memory are made inaccessible to the microprocessor by rendering an appropriate line of data in the cache memory uncacheable to the microprocessor. When faulty data bits are not repairable through conventional repair means such as row/column redundancy, the tag RAM may be programmed with the address of the faulty data bit such that when the microprocessor requests data at that address, a comparator inside the tag RAM generates a signal indicative of a "miss" condition which is an output signal of the tag RAM. The miss condition is communicated to the microprocessor which must access the requested data from main memory. In this way, a cache memory having faulty data bits may still be utilized.

Inventors

  • 👤 David C. McClure

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-04 14:44
CPC Classifications
G; G11; G11C; G11C29/00; G11C29/70; G11C29/88; G06; G06F; G06F12/00; G06F12/02; G06F12/08; G06F12/0802; G06F12/0888

Claims Analysis

Total Claims: 18
Claim 1
Independent Claim 134 words
Circuitry for bypassing faulty data locations in cache memory, comprising: a cache memory, having at least one faulty data location, which store a plurality of data; a tag RAM which stores a plurality of addresses of the plurality of data stored in the cache memory; and bypass circuitry of the tag RAM which forces the tag RAM to generate a predetermined output signal indicative of a Miss condition for a tag RAM address which corresponds to the at least one faulty data location, such that the at least one faulty data location is permanently bypassed and thus made uncacheable without the need for monitoring and setting a bit whose sole function is to communicate if the at least one faulty data location is faulty, wherein the predetermined output signal is received by a microprocessor.
Claim 2
Dependent Claim 134 words
Circuitry for bypassing faulty data locations in cache memory, comprising: a cache memory, having at least one faulty data location, which store a plurality of data; a tag RAM which stores a plurality of addresses of the plurality of data stored in the cache memory; and bypass circuitry of the tag RAM which forces the tag RAM to generate a predetermined output signal indicative of a Miss condition for a tag RAM address which corresponds to the at least one faulty data location, such that the at least one faulty data location is permanently bypassed and thus made uncacheable without the need for monitoring and setting a bit whose sole function is to communicate if the at least one faulty data location is faulty, wherein the predetermined output signal is received by a microprocessor.
Claim 3
Dependent Claim 14 words
The circuitry of claim 1, wherein the cache memory is a primary cache memory.
Claim 4
Dependent Claim 15 words
The circuitry of claim 2, wherein the primary cache memory is embedded in the microprocessor.
Claim 5
Dependent Claim 18 words
The circuitry of claim 1, wherein the cache memory is embedded in an application specific integrated circuit (ASIC).
Claim 6
Dependent Claim 16 words
The circuitry of claim 1, wherein the cache memory is part of a direct-mapped cache system.
Claim 7
Dependent Claim 26 words
The circuitry of claim 1, wherein the cache memory is part of a set-associative cache system and is split into a plurality of cache memory sets.
Claim 8
Dependent Claim 21 words
The circuitry of claim 6, wherein the cache memory is split into two cache sets in a two-way set-associative cache system.
Claim 9
Dependent Claim 21 words
The circuitry of claim 6, wherein the cache memory is split into four cache sets in a four-way set-associative cache system.
Claim 10
Dependent Claim 29 words
The circuitry of claim 1, wherein the tag RAM or the cache memory are partitioned such that memory cells associated with an address are physically adjacent to each other.
Claim 11
Dependent Claim 30 words
The circuitry of claim 1, wherein the memory cells of the cache memory are partitioned such that the memory cells of a data line are physically adjacent to each other.
Claim 12
Dependent Claim 38 words
The circuitry of claim 1, wherein a faulty word in cache memory is made uncacheable by communicating an address of the faulty word directly to the microprocessor without forcing the tag RAM to generate the predetermined output signal.
Claim 13
Dependent Claim 44 words
The circuitry of claim 1, wherein an entire cache memory data line is made uncacheable if the at least one faulty data location is found in the cache memory data line or in a tag RAM location corresponding to the cache memory data line.
Claim 14
Dependent Claim 231 words
The circuitry of claim 1, wherein the bypass circuitry for forcing the tag RAM to generate the predetermined output signal for a the tag RAM address which corresponds to the at least one faulty data location, further comprises: a plurality of transistors, each having a gate, a first transistor terminal and a second transistor terminal, with the first transistor terminal connected to a first supply voltage; a plurality of true and complement address bits which define the tag RAM address, each of which is connected to the gate of a corresponding transistor; a plurality of fuses, each having a first fuse terminal and a second fuse terminal, with the first fuse terminal connected to the second terminal of a corresponding transistor; compare circuitry which generates the predetermined output signal for the tag RAM address which corresponds to the at least one faulty data location; and a node connected to the second fuse terminal of each of the plurality of fuses and to a second supply voltage through a bias transistor having a gate, a first terminal, and a second terminal, wherein a voltage level of the node determines if the compare circuitry will be forced to generate the tag RAM output signal, and wherein the first terminal of the bias transistor is connected to the node and the second terminal of the bias transistor is connected to the second supply voltage.
Claim 15
Dependent Claim 19 words
The circuitry of claim 13, wherein the predetermined output signal is a Match output signal of the tag RAM.
Claim 16
Dependent Claim 20 words
The circuitry of claim 13, wherein the first supply voltage is V cc and the second supply voltage is ground.
Claim 17
Dependent Claim 18 words
The circuitry of claim 13, wherein the gate of the bias transistor is driven by a bias signal.
Claim 18
Dependent Claim 25 words
The circuitry of claim 13, wherein at least one of the plurality of fuses is blown to identify the at least one faulty data location.

References Cited (Backward Citations)

US4357656A Cited
US4335459A Cited
US5070502A Cited
US5357521A Cited
US5204836A Cited
US5317711A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1999-08-27 2000-02-26 2000-08-27 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2003-08-27 2004-02-26 2004-08-27 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2007-08-27 2008-02-26 2008-08-27 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag