# US 2014/0372711 A1 · Scheduling memory accesses using an efficient row burst value

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

- Number: US 2014/0372711 A1
- Document ID: US20140372711A1
- Status: Published application
- Kind: A1
- Application number: 13/917,033
- Filed: 2013-06-13
- Published: 2014-12-18
- Earliest claimed: 2013-06-13
- Assignees: Advanced Micro Devices, Inc.
- Applicants: Advanced Micro Devices, Inc.
- Inventors: James M. O'Connor; Niladrish Chatterjee; Nuwan S. Jayasena; Gabriel H. Loh
- Web page: https://patentgrep.com/patent/US20140372711A1

## CPC

- G06F 13/1626: {by reordering requests}
- G06F 13/161: {with latency improvement}
- G06F 13/1694: {Configuration of memory controller to different memory types}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A memory accessing agent includes a memory access generating circuit and a memory controller. The memory access generating circuit is adapted to generate multiple memory accesses in a first ordered arrangement. The memory controller is coupled to the memory access generating circuit and has an output port, for providing the multiple memory accesses to the output port in a second ordered arrangement based on the memory accesses and characteristics of an external memory. The memory controller determines the second ordered arrangement by calculating an efficient row burst value and interrupting multiple row-hit requests to schedule a row-miss request based on the efficient row burst value.

## Claims

### Claim 1

A memory accessing agent comprising:
a memory access generating circuit adapted to generate a plurality of memory accesses in a first ordered arrangement; and
a memory controller coupled to said memory access generating circuit and having an output port, for providing said plurality of memory accesses to said output port in a second ordered arrangement based on said memory accesses and characteristics of an external memory, said memory controller determining said second ordered arrangement in response to an efficient row burst value and interrupting a plurality of row-hit requests to schedule a row-miss request based on said efficient row burst value.

### Claim 2 (depends on 1)

The memory accessing agent of claim 1, wherein said memory controller calculates said efficient row burst value based on a specification of said memory.

### Claim 3 (depends on 2)

The memory accessing agent of claim 2, wherein said specification comprises at least one of an activation-to-activation time and an activation-to-precharge time.

### Claim 4 (depends on 1)

The memory accessing agent of claim 1, wherein based on said efficient row burst value, said memory controller prioritizes said row-hit request in response to a type of said memory access generating circuit.

### Claim 5

A memory controller comprising:
a scheduler for selecting memory access requests in an order in response to memory characteristics, said scheduler for interrupting a plurality of row-hit requests to schedule a row-miss request based on an efficient row burst value; and
an output circuit coupled to said scheduler, adapted to be coupled to a memory, said output circuit adapted to access said memory.

### Claim 6 (depends on 5)

The memory controller of claim 5 further comprising:
a lookup table coupled to said scheduler, wherein said scheduler calculates said efficient row burst value and stores said efficient row burst value in said lookup table after calculating said efficient row burst value.

### Claim 7 (depends on 6)

The memory controller of claim 6 wherein said scheduler further stores a count of a number of requests sent to a row of a memory bank of said memory.

### Claim 8 (depends on 5)

The memory controller of claim 5 further comprising:
a queue for receiving and storing memory access requests, wherein said scheduler selects said memory access requests from said queue in said order.

### Claim 9 (depends on 8)

The memory controller of claim 8 wherein said queue stores memory access requests corresponding to a respective memory bank of said memory and an access request type.

### Claim 10 (depends on 9)

The memory controller of claim 9 wherein said scheduler schedules said access request type based on said efficient row burst value.

### Claim 11 (depends on 9)

The memory controller of claim 9 wherein said access request type comprises at least a selected one of an age of an access request, a highest priority access request, and a row buffer hit access request.

### Claim 12 (depends on 5)

The memory controller of claim 5, wherein said scheduler is further adapted to schedule a sequence of accesses including a second plurality of row-hit requests in a plurality of memory banks of said memory and a second row-miss request in another memory bank of said memory in response to said efficient row burst value.

### Claim 13 (depends on 5)

The memory controller of claim 5, wherein said scheduler is further adapted to schedule said row-miss request based on a number of a plurality of memory banks of said memory having scheduled row-hit requests.

### Claim 14 (depends on 5)

The memory controller of claim 5, wherein said efficient row burst value is based on a number of a plurality of memory banks of said memory, B, a number of row-miss latency cycles, N, and a number of row-hit latency cycles, M.

### Claim 15 (depends on 14)

The memory controller of claim 14, wherein said efficient row burst value is based on a value multiplied by said number of said plurality of memory banks of said memory.

### Claim 16

A method comprising:
providing memory accesses to an output port in an order based on characteristics of said memory accesses and a memory;
interrupting a plurality of row-hit requests to said memory based on an efficient row burst value; and
scheduling a row-miss request to said memory after said interrupting.

### Claim 17 (depends on 16)

The method of claim 16 further comprising:
calculating said efficient row burst value; and
storing said efficient row burst value in a lookup table.

### Claim 18 (depends on 17)

The method of claim 17 wherein said calculating comprises calculating said efficient row burst value based on a number of a plurality of memory banks of said memory, B, a number of row-miss latency cycles, N, and a number of row-hit latency cycles, M.

### Claim 19 (depends on 18)

The method of claim 18 wherein said calculating further comprises calculating said efficient row burst value is based on a value multiplied by said number of said plurality of memory banks of said memory.

### Claim 20 (depends on 16)

The method of claim 16 further comprising:
scheduling an access based on an access request type and said efficient row burst value, said access request type comprising at least one of an age of an access request, a high priority access request, and a row buffer hit access request.
