# US 2014/0208035 A1 · Cache circuit having a tag array with smaller latency than a data array

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

- Number: US 2014/0208035 A1
- Document ID: US20140208035A1
- Status: Published application
- Kind: A1
- Application number: 13/997,655
- Filed: 2011-12-30
- Published: 2014-07-24
- Earliest claimed: 2011-12-30
- Assignees: Intel Corporation
- Inventors: Larisa Novakovsky
- Web page: https://patentgrep.com/patent/US20140208035A1

## CPC

- G06F 12/0842: for multiprocessing or multitasking
- G06F 12/0853: Cache with multiport tag or data arrays
- G06F 12/0855: Overlapped cache accessing, e.g. pipeline (G06F12/0846 takes precedence)
- G06F 12/0895: of parts of caches, e.g. directory or tag array
- G06F 13/1642: {with request queuing}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method is described that includes alternating cache requests sent to a tag array between data requests and dataless requests.

## Claims

### Claim 1

A semiconductor chip, comprising:
a cache comprising a tag array and a data array, said tag array having lower latency than said data array;
a first cache request path that flows into said tag array;
a second cache request path that flows into said tag array;
logic circuity to determine whether a cache request is a data request or a dataless request, and, place said cache request onto said first cache request path if said cache request is a data request, or, place said cache request onto said second cache request path if said cache request is a dataless request.

### Claim 2 (depends on 1)

The semiconductor chip of claim 1 wherein an access of said tag array consumes one cycle and an access of said data array consumes two cycles.

### Claim 3 (depends on 2)

The semiconductor chip of claim 2 wherein said tag array consumes larger storage cells than said data array.

### Claim 4 (depends on 2)

The semiconductor chip of claim 2 wherein said tag array consumes larger storage cells than said data array.

### Claim 5 (depends on 1)

The semiconductor chip of claim 1 wherein said dataless request can be any of:
a prefetch;
a snoop;
an MEU full line update.

### Claim 6 (depends on 1)

The semiconductor chip of claim 1 wherein servicing logic circuitry alternates servicing of cache access request between said servicing cache access requests from said first cache access request path and servicing cache access requests from said second cache access request path.

### Claim 7 (depends on 1)

The semiconductor chip of claim 1 wherein said logic circuitry services cache access requests from said first and second cache access request paths in a round robin fashion where cache access request paths that carry dataless requests are serviced in between cache access request paths that carry data requests.

### Claim 8

A method, comprising:
alternating cache requests sent to a tag array between data requests and dataless requests.

### Claim 9 (depends on 8)

The method of claim 8 wherein said dataless requests are any of:
a prefetch;
a snoop;
an MEU fill line update.

### Claim 10 (depends on 8)

The method of claim 8 further comprising classifying each of multiple incoming cache requests, before said cache request are sent to said tag array, as being either a data request or a dataless request.

### Claim 11 (depends on 10)

The method of claim 10 wherein said method further comprises placing data requests on a first path that flows to said tag array, and, placing dataless requests on a second path that flows to said tag array.

### Claim 12 (depends on 11)

The method of claim 11 wherein both said paths contain their own respective FIFO queues.

### Claim 13

A computing system, comprising two connected semiconductor chips, each of the two connected semiconductor chips, comprising:
multiple processing cores;
a cache with cache access circuitry, comprising:
a cache comprising a tag array and a data array, said tag array having lower latency than said data array;
a first cache request path that flows into said tag array;
a second cache request path that flows into said tag array;
logic circuity to determine whether a cache request is a data request or a dataless request, and, place said cache request onto said first cache request path if said cache request is a data request, or, place said cache request onto said second cache request path if said cache request is a dataless request.

### Claim 14 (depends on 13)

The computing system of claim 13 wherein an access of said tag array consumes one cycle and an access of said data array consumes two cycles.

### Claim 15 (depends on 14)

The computing system of claim 14 wherein said tag array consumes larger storage cells than said data array.

### Claim 16 (depends on 14)

The computing system of claim 14 wherein said tag array consumes larger storage cells than said data array.

### Claim 17 (depends on 13)

The computing system of claim 13 wherein said dataless request can be any of:
a prefetch;
a snoop;
an MEU full line update.

### Claim 18 (depends on 13)

The computing system of claim 13 wherein servicing logic circuitry alternates servicing of cache access request between said servicing cache access requests from said first cache access request path and servicing cache access requests from said second cache access request path.

### Claim 19 (depends on 13)

The computing system of claim 13 wherein said logic circuitry services cache access requests from said first and second cache access request paths in a round robin fashion where cache access request paths that carry dataless requests are serviced in between cache access request paths that carry data requests.
