# US 2018/0322053 A1 · Efficient early ordering mechanism

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

- Number: US 2018/0322053 A1
- Document ID: US20180322053A1
- Status: Published application
- Kind: A1
- Application number: 15/968,905
- Filed: 2018-05-02
- Published: 2018-11-08
- Earliest claimed: 2017-05-05
- Assignees: Samsung Electronics Co., Ltd.
- Applicants: Samsung Electronics Co., Ltd.
- Inventors: Erik HAGERSTEN; Andreas Sembrant
- Web page: https://patentgrep.com/patent/US20180322053A1

## CPC

- G06F 12/0811: with multilevel cache hierarchies
- G06F 12/0897: with two or more cache hierarchy levels (with multilevel cache hierarchies G06F12/0811)
- G06F 2212/1008: Correctness of operation, e.g. memory ordering
- G06F 2212/60: Details of cache memory
- G06F 2212/608: Details relating to cache mapping
- Y02D 10/00: Energy efficient computing, e.g. low power processors, power management or thermal management
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- Y02D: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE

## Abstract

Data units are stored in private caches in nodes of a multiprocessor system, each node containing at least one processor (CPU), at least one cache private to the node and at least one cache location buffer (CLB) private to the node. In each CLB location information values are stored, each location information value indicating a location associated with a respective data unit, wherein each location information value stored in a given CLB indicates the location to be either a location within the private cache disposed in the same node as the given CLB, to be a location in one of the other nodes, or to be a location in a main memory. Coherence of values of the data units is maintained using a cache coherence protocol. The location information values stored in the CLBs are updated by the cache coherence protocol in accordance with movements of their respective data units.

## Claims

### Claim 1

A multiprocessor system comprising:
a plurality of nodes and at least one memory, wherein each node contains at least one processor, a first cache, and a second cache private to the node, and a first cache location buffer (CLB) private to the node,
wherein the first CLB stores a plurality of first CLB entries, each the first CLB entry including an address tag field and a cache location table (CLT), which includes a plurality of location information values with the address tag field, each location information value indicating a location associated with a respective data unit,
wherein the location information values are used to search a target cache line from the first cache or the second cache.

### Claim 2 (depends on 1)

The multiprocessor system of claim 1,
wherein the first cache has a level hierarchy different from that of the second cache.

### Claim 3 (depends on 1)

The multiprocessor system of claim 1,
wherein the processor is equally accessible to the first cache and the second cache to search the target cache line using the location information value corresponding to the target cache line.

### Claim 4 (depends on 3)

The multiprocessor system of claim 3,
wherein the processor acquires a data unit of the target cache line from the first cache when the target cache line is stored in the first cache as a result of the search.

### Claim 5 (depends on 1)

The multiprocessor system of claim 1,
wherein the first cache and the second cache store a plurality of cache entries, and the cache entry includes a backward pointer for updating the first CLB and a cache line including a data unit.

### Claim 6 (depends on 5)

The multiprocessor system of claim 5, further comprising a second cache location buffer (CLB) private to the node,
wherein the second CLB stores a plurality of second CLB entries, each the second CLB entry including a cache location table (CLT) and a pointer to the first CLB.

### Claim 7 (depends on 6)

The multiprocessor system of claim 6,
wherein the first CLB has a level hierarchy different from that of the second CLB.

### Claim 8 (depends on 6)

The multiprocessor system of claim 6,
wherein the backward pointer points to at least one the second CLB entries,
wherein the pointer of the pointed second CLB entry points to the first CLB entry that includes the CLT corresponding to the CLT of the pointed second CLB entry.

### Claim 9 (depends on 8)

The multiprocessor system of claim 8,
wherein the processor update location information value for the target cache line using the first CLB when any one of the first CLB entries is pointed by the pointer.

### Claim 10 (depends on 8)

The multiprocessor system of claim 8,
wherein the processor copy at least one of the second CLB entries to the first CLB, and copy at least one of the first CLB entries to the second CLB when all the first CLB entries are not pointed by the pointer.

### Claim 11 (depends on 1)

The multiprocessor system of claim 1,
wherein the processor acquires the location information value corresponding the target cache line by matching an address corresponding to the target cache line with the first CLB entries.

### Claim 12 (depends on 11)

The multiprocessor system of claim 11,
wherein the address includes a tag portion for matching with the address field and an offset portion for selecting the location information value corresponding to the target cache line.

### Claim 13

A data management method for a processor to which a first cache and a second cache are allocated,
matching the target cache line related address with first CLB entries stored in a first cache location buffer (CLB); and
acquiring a target data unit corresponding to the target cache line from either the first cache or the second cache based on the match result,
wherein each the first CLB entry including an address tag field and a cache location table (CLT), which includes a plurality of location information values with the address tag field, each location information value indicating a location associated with a respective data unit.

### Claim 14 (depends on 13)

The method of claim 13, wherein the matching the target cache line further comprises:
matching a tag portion of the address with the address tag fields of the first CLB entries;
acquiring the location information value of the target cache line from the first CLB entry including the address tag field matched with the tag portion of the address.

### Claim 15 (depends on 14)

The method of claim 14, wherein the acquiring the location information value further comprises:
selecting the location information value among the CLT corresponding to the matched address tag field by using an offset portion of the address.

### Claim 16 (depends on 13)

The method of claim 13, wherein the acquiring the target data unit further comprises:
accessing the first cache or the second cache;
searching the target data unit among data units stored in the first cache or the second cache using the location information value corresponding to the target cache line and an index portion of the address.

### Claim 17 (depends on 13)

The method of claim 13, further comprises:
determining whether to update using the first CLB based on whether it is an active entry of the first CLB entries when updating the location information values for data units stored in the first cache or the second cache.

### Claim 18 (depends on 17)

The method of claim 17, further comprises:
wherein the first cache and the second cache store a plurality of cache entries, and the cache entry includes a backward pointer for updating the first CLB and a cache line including a data unit,
wherein the determining whether to update using the first CLB further comprises:
comparing a cache location table (CLT)s of a second cache location buffer (CLB) entries stored in a second CLB, which has a level hierarchy different from that of the first CLB, pointed by the backward pointers respectively and the CLTs of the first CLB entries corresponding to the second CLB entries; and
determining whether the active entry is for the first CLB entry based on the comparison result.

### Claim 19

A non-transitory computer readable medium storing a program causing a computer to execute a process for presenting information, the process comprising:
matching the target cache line related address with CLB entries stored in a cache location buffer (CLB); and
acquiring a target data unit corresponding to the target cache line from either the first cache or the second cache based on the match result.

### Claim 20 (depends on 19)

The non-transitory computer readable medium according to claim 19.
wherein each the CLB entry including an address tag field and a cache location table (CLT), which includes a plurality of location information values with the address tag field, each location information value indicating a location associated with a respective data unit.
