# US 2010/0169739 A1 · Poison bit error checking code scheme

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2010/0169739 A1
- Document ID: US20100169739A1
- Status: Published application
- Kind: A1
- Application number: 12/317,849
- Filed: 2008-12-29
- Published: 2010-07-01
- Earliest claimed: 2008-12-29
- Assignees: Intel Corporation
- Inventors: Rajat Agarwal; Scott Huddleston; Dennis Brzezinski
- Web page: https://patentgrep.com/patent/US20100169739A1

## CPC

- G06F 11/1012: {using codes or arrangements adapted for a specific type of error (G06F11/1048 takes precedence)}
- G06F 11/1064: {in cache or content addressable memories}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

In one embodiment, a method provides determining one of an occurrence and a non-occurrence of an event, the one of the occurrence and the non-occurrence resulting in an event determination; and processing a code having an event bit, said processing in accordance with the determination and the code, by determining if the event bit corresponds to the event determination, and if the event bit does not correspond to the event determination, encoding the code to generate a poison bit that corresponds to the event determination.

## Claims

### Claim 1

An apparatus to poison at least one bit, the apparatus comprising logic to:
generate an ECC (error correction code) corresponding to a cache line to be stored in a shared memory, the ECC having an event bit;
determine one of an occurrence and a non-occurrence of an event to generate an event determination;
process the ECC code in accordance with the event bit and the event determination;
store the processed ECC code and the corresponding cache line in a memory.

### Claim 2 (depends on 1)

The apparatus of claim 1, wherein the shared memory is shared by a plurality of processors, and the corresponding cache line is requested to be stored by one processor of the plurality of processors, said logic to determine one of an occurrence and a non-occurrence of the event comprises logic to determine if the one processor additionally cached data in its local cache.

### Claim 3 (depends on 1)

The apparatus of claim 1, wherein the logic to process the ECC code in accordance with the event bit and the event determination comprises logic to determine if the event bit corresponds to the event determination, and if the event bit does not correspond to the event determination, encoding the ECC to generate a poison bit that corresponds to the event determination.

### Claim 4 (depends on 1)

The apparatus of claim 1, wherein the logic to process the code comprises encoding the code using a poison mask.

### Claim 5 (depends on 2)

The apparatus of claim 2, additionally comprising logic to:
read the ECC from the memory (“read code”);
process the read code to generate a first processed code and a second processed code;
infer the occurrence of the event based, at least in part, on the first processed code and the second processed code.

### Claim 6 (depends on 5)

The apparatus of claim 5, wherein said logic to process the read code to generate a first processed code and a second processed code comprises logic to decode the read code to generate a decoded read code, to perform code checking on the decoded read code, and to perform code checking on the read code.

### Claim 7 (depends on 6)

The apparatus of claim 6, where said logic to decode the read code to generate a decoded read code comprises applying an inverse of the poison mask to the read code.

### Claim 8 (depends on 5)

The apparatus of claim 5, wherein said logic to infer the occurrence of the event based, at least in part, on the first processed code and the second processed code comprises logic to:
identify correctable code; and
read the event bit of the correctable code to determine one of the occurrence and the non-occurrence of the event.

### Claim 9

A system comprising:
a plurality of processors;
a shared memory coupled to the plurality of processors; and
an integrated circuit coupled to the plurality of processors, and having memory controller logic to:
generate an ECC (error correction code) corresponding to a cache line to be stored in a shared memory;
determine one of an occurrence and a non-occurrence of an event to generate an event determination;
process the ECC in accordance with the event determination; and
store the processed ECC and the corresponding cache line in the memory.

### Claim 10 (depends on 9)

The system of claim 9, wherein the corresponding cache line is requested to be stored by one processor of the plurality of processors, said memory controller logic to determine one of an occurrence and a non-occurrence of the event comprises logic to determine if the one processor additionally cached data in its local cache.

### Claim 11 (depends on 9)

The system of claim 9, wherein the logic to process the ECC code in accordance with the event bit and the event determination comprises logic to determine if the event bit corresponds to the event determination, and if the event bit does not correspond to the event determination, encoding the ECC to generate a poison bit that corresponds to the event determination.

### Claim 12 (depends on 9)

The system of claim 9, wherein the memory controller logic to additionally:
read the code from the memory (“read code”);
process the read code to generate a plurality of processed codes;
identifying a correctable code from one of the plurality of processed codes; and
if a correctable code is identified, reading the event bit of the correctable code to determine one of the occurrence and non-occurrence of the event.

### Claim 13 (depends on 12)

The system of claim 12, wherein said memory controller logic to process the read code to generate a plurality of processed codes comprises logic to decode the read code to generate a decoded read code, to perform code checking on the decoded read code, and to perform code checking on the read code.

### Claim 14 (depends on 13)

The system of claim 13, where said logic to decode the read code to generate a decoded read code comprises applying an inverse of the poison mask to the read code.

### Claim 15

A method comprising:
determining one of an occurrence and a non-occurrence of an event, the one of the occurrence and the non-occurrence resulting in an event determination; and
processing a code having an event bit, said processing in accordance with the determination and the code, by:
determining if the event bit corresponds to the event determination; and
if the event bit does not correspond to the event determination, encoding the code to generate a poison bit that corresponds to the event determination.

### Claim 16 (depends on 15)

The method of claim 15, additionally comprising storing the code in a memory.

### Claim 17 (depends on 16)

The method of claim 16, additionally comprising:
reading the code from the memory (“read code”);
processing the read code to generate a plurality of processed codes;
identifying a correctable code from one of the plurality of processed codes; and
if a correctable code is identified, reading the event bit of the correctable code to determine one of the occurrence and the non-occurrence of the event.

### Claim 18 (depends on 17)

The method of claim 17, wherein said processing the read code comprises:
decoding the read code;
performing code checking on read code to generate a first processed code; and
performing code checking on the read code to generate a second processed code.

### Claim 19

An article of manufacture having stored thereon instructions, the instructions when executed by a machine, result in the following:
determining one of an occurrence and a non-occurrence of an event, the one of the occurrence and the non-occurrence resulting in an event determination; and
processing a code having an event bit, said processing in accordance with the determination and the code, by:
determining if the event bit corresponds to the event determination; and
if the event bit does not correspond to the event determination, encoding the code to generate a poison bit that corresponds to the event determination.

### Claim 20 (depends on 19)

The article of claim 19, additionally comprising instructions that, when executed by a machine, result in storing the code in a memory.

### Claim 21 (depends on 20)

The article of claim 20, additionally comprising instructions that, when executed by a machine, result in:
reading the code from the memory (“read code”);
processing the read code to generate a plurality of processed codes;
identifying a correctable code from one of the plurality of processed codes; and
if a correctable code is identified, reading the event bit of the correctable code to determine one of the occurrence and the non-occurrence of the event.

### Claim 22 (depends on 21)

The article of claim 21, wherein said instructions that result in processing the read code comprises instructions that, when executed by a machine, result in:
decoding the read code;
performing code checking on read code to generate a first processed code; and
performing code checking on the read code to generate a second processed code.
