Method and system for bypassing a faulty line of data or its associated tag of a set associative cache memory

Claim 3

The method of claim 1, wherein the set associative cache memory has a plurality of lines of data contained in a plurality of sets and each line of data has an address and at least one replacement status bit associated with it which indicates when each line of data was used relative to other lines of data of different sets corresponding to the same address.

Claim 4

The method of claim 2, wherein the replacement logic circuit uses a least recently used (LRU) replacement algorithm to update a least recently used (LRU) line of data with the replacement line of data.

Claim 5

The method of claim 3, wherein the replacement status bit of the faulty line of data is forced to a first logic level which denotes the faulty line of data as a more recently used line of data which is not updated by the replacement line of data; rather a line of data of the second set whose replacement status bit is equal to a second logic level which denotes the line of data as the least recently used (LRU) line of data is updated by the replacement line of data.

Claim 6

The method of claim 3, wherein when the replacement status bit of a line of data denotes the line of data as the least recently used (LRU) line of data, the line of data is updated with the replacement line of data; however, when the faulty line of data is the LRU line of data, the faulty line of data is bypassed and another line of data is updated with the replacement line of data as determined by the replacement logic circuit.

Claim 7

The method of claim 1, wherein a programming means is used to identify the address of the faulty line of data.

Claim 8

The method of claim 6, wherein the programming means uses fuse programming.

Claim 9

The method of claim 6, wherein the programming means uses a plurality of registers.

Claim 10

The method of claim 8, wherein the registers are loaded using a built-in self test (BIST) circuit.

Claim 11

The method of claim 6, wherein the programming means uses nonvolatile devices.

Claim 12

The method of claim 1, wherein the replacement logic circuit uses a first in first out (FIFO) replacement algorithm.

Claim 13

The method of claim 1, wherein the replacement logic circuit uses a last in first out (LIFO) replacement algorithm.

Claim 14

The method of claim 1, wherein the replacement logic circuit uses a random replacement algorithm.

Claim 15

The method of claim 1, wherein the replacement logic circuit uses a pseudo least recently used (LRU) replacement algorithm.

Claim 16

The method of claim 1, wherein the set associative cache memory is an embedded cache memory.

Claim 17

The method of claim 15, wherein the embedded cache memory is a primary cache of a microprocessor.

Claim 18

A structure for bypassing a faulty line of data or its associated tag of a set associative cache memory, comprising: a set associative cache memory having a plurality of lines of data contained in a plurality of sets with each line of data having at least one replacement status bit associated with it which indicates when each line of data was used relative to other lines of data of different sets corresponding to an address; a faulty address identification block which identifies an address of a faulty line of data of the plurality of lines of data of a set of the plurality of sets; a logic element having the address of the faulty line of data as an input signal which generates a faulty line of data address signal corresponding to the address of the faulty line of data; a replacement logic circuit which performs logic on the faulty line of data address signal, an address hit/miss signal, and a status bit signal to produce a logic state of a replacement status bit of the faulty line of data that flags the address of the faulty line of data such that when an address of a faulty line of data is detected during a replacement cycle following a cache miss condition the faulty line of data is bypassed, wherein the address hit/miss signal indicates whether there is a cache hit or a cache miss condition for the first set of the set associative cache memory.

Claim 19

A structure for bypassing a faulty line of data or its associated tag of a set associative cache memory, comprising: a set associative cache memory having a plurality of lines of data contained in a plurality of sets with each line of data having at least one replacement status bit associated with it which indicates when each line of data was used relative to other lines of data of different sets corresponding to an address; a faulty address identification block which identifies an address of a faulty line of data of the plurality of lines of data of a set of the plurality of sets; a logic element having the address of the faulty line of data as an input signal which generates a faulty line of data address signal corresponding to the address of the faulty line of data; a replacement logic circuit which performs logic on the faulty line of data address signal, an address hit/miss signal, and a status bit signal to produce a logic state of a replacement status bit of the faulty line of data that flags the address of the faulty line of data such that when an address of a faulty line of data is detected during a replacement cycle following a cache miss condition the faulty line of data is bypassed, wherein the address hit/miss signal indicates whether there is a cache hit or a cache miss condition for the first set of the set associative cache memory.

Claim 20

The structure of claim 17, wherein the replacement logic circuit uses a least recently used (LRU) replacement algorithm to update a least recently used (LRU) line of data with a replacement line of data.

Claim 21

The structure of claim 18, wherein the replacement status bit of the faulty line of data is forced to a first logic level which denotes the faulty line of data as a more recently used line of data which is not updated by the replacement line of data; rather a line of data whose replacement status bit is equal to a second logic level which denotes the line of data as the least recently used (LRU) line of data is updated by the replacement line of data.

Claim 22

The structure of claim 18, wherein when the replacement status bit of a line of data denotes the line of data as the least recently used (LRU) line of data, the line of data is updated with the replacement line of data; however, when the faulty line of data is the LRU line of data, the faulty line of data is bypassed and another line of data is updated with the replacement line of data as determined by the replacement logic circuit.

Claim 23

The structure of claim 17, wherein a programming means is used to identify the address of the faulty line of data.

Claim 24

The structure of claim 21, wherein the programming means uses fuse programming.

Claim 25

The structure of claim 21, wherein the programming means uses a plurality of registers.

Claim 26

The structure of claim 23, wherein the registers are loaded using a built-in self test (BIST) circuit.

Claim 27

The structure of claim 21, wherein the programming means uses nonvolatile devices.

Claim 28

The structure of claim 17, wherein the replacement logic circuit uses a first in first out (FIFO) replacement algorithm.

Claim 29

The structure of claim 17, wherein the replacement logic circuit uses a last in first out (LIFO) replacement algorithm.

Claim 30

The structure of claim 17, wherein the replacement logic circuit uses a random replacement algorithm.

Claim 31

The structure of claim 17, wherein the replacement logic circuit uses a pseudo least recently used (LRU) replacement algorithm.

Claim 32

The structure of claim 17, wherein the set associative cache memory is an embedded cache memory.

Claim 33

The structure of claim 30, wherein the embedded cache memory is a primary cache of a microprocessor.