# US 2024/0202127 A1 · Sideband instruction address translation

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

- Number: US 2024/0202127 A1
- Document ID: US20240202127A1
- Status: Published application
- Kind: A1
- Application number: 18/066,480
- Filed: 2022-12-15
- Published: 2024-06-20
- Earliest claimed: 2022-12-15
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Bryan Lloyd; David A. Hrusecky; Richard J. Eickemeyer; Mohit Karve; Dung Q. Nguyen; Nicholas R. Orzol; Sheldon Bernard Levenstein; Naga P. Gorti
- Web page: https://patentgrep.com/patent/US20240202127A1

## CPC

- G06F 12/0875: with dedicated cache, e.g. instruction or stack
- G06F 9/30043: {LOAD or STORE instructions; Clear instruction}
- G06F 9/3802: {Instruction prefetching}
- G06F 2212/1024: Latency reduction
- G06F 2212/452: Instruction code
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Embodiments relate to sideband instruction address translation. According to an aspect, a computer-implemented method includes managing, within a processor, an instruction effective-to-real-address table (I-ERAT) separate from a main ERAT, where the I-ERAT has a smaller storage capacity than the main ERAT. The method also includes indicating an I-ERAT hit based on determining that an instruction address for an instruction cache is stored in the I-ERAT, bypassing an arbitrator within the processor and sending a translated address from the I-ERAT to the instruction cache based on detecting the I-ERAT hit, and sending an address translation request through the arbitrator to the main ERAT based on an I-ERAT miss and writing a translation result of the main ERAT to the I-ERAT.

## Claims

### Claim 1

A computer-implemented method comprising:
managing, within a processor, an instruction effective-to-real-address table (I-ERAT) separate from a main ERAT, wherein the I-ERAT has a smaller storage capacity than the main ERAT;
indicating an I-ERAT hit based on determining that an instruction address for an instruction cache is stored in the I-ERAT;
bypassing an arbitrator within the processor and sending a translated address from the I-ERAT to the instruction cache based on detecting the I-ERAT hit; and
sending an address translation request through the arbitrator to the main ERAT based on an I-ERAT miss and writing a translation result of the main ERAT to the I-ERAT.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, wherein the processor comprises an instruction fetch unit (IFU) and a load store unit (LSU).

### Claim 3 (depends on 2)

The computer-implemented method of claim 2, wherein the I-ERAT is distributed between the IFU and the LSU with effective addresses stored in the IFU and real addresses stored in the LSU.

### Claim 4 (depends on 3)

The computer-implemented method of claim 3, wherein the LSU comprises the arbitrator and the main ERAT.

### Claim 5 (depends on 1)

The computer-implemented method of claim 1, wherein address translation through the I-ERAT completes at least two cycles faster than through the arbitrator and the main ERAT.

### Claim 6 (depends on 1)

The computer-implemented method of claim 1, wherein the processor is a multi-thread processor and address mapping through the I-ERAT is based on a number of threads.

### Claim 7 (depends on 1)

The computer-implemented method of claim 1, wherein bypassing of the arbitrator is further based on determining that an arbitration cycle of the arbitrator is available.

### Claim 8

A system of a processor comprising:
an instruction cache;
an arbitrator;
an instruction effective-to-real-address table (I-ERAT);
a main ERAT, wherein the I-ERAT has a smaller storage capacity than the main ERAT; and
circuitry configured to:
indicate an I-ERAT hit based on determining that an instruction address for the instruction cache is stored in the I-ERAT;
bypass the arbitrator and send a translated address from the I-ERAT to the instruction cache based on detecting the I-ERAT hit; and
send an address translation request through the arbitrator to the main ERAT based on an I-ERAT miss and write a translation result of the main ERAT to the I-ERAT.

### Claim 9 (depends on 8)

The system of claim 8, further comprising an instruction fetch unit (IFU) and a load store unit (LSU).

### Claim 10 (depends on 9)

The system of claim 9, wherein the I-ERAT is distributed between the IFU and the LSU with effective addresses stored in the IFU and real addresses stored in the LSU.

### Claim 11 (depends on 10)

The system of claim 10, wherein the LSU comprises the arbitrator and the main ERAT.

### Claim 12 (depends on 8)

The system of claim 8, wherein address translation through the I-ERAT completes at least two cycles faster than through the arbitrator and the main ERAT.

### Claim 13 (depends on 8)

The system of claim 8, wherein the processor is a multi-thread processor and address mapping through the I-ERAT is based on a number of threads.

### Claim 14 (depends on 8)

The system of claim 8, wherein bypassing of the arbitrator is further based on determining that an arbitration cycle of the arbitrator is available.

### Claim 15

A computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by one or more processors to cause the one or more processors to perform operations comprising:
storing a plurality of address translations within an instruction effective-to-real-address table (I-ERAT) and a main ERAT, wherein the I-ERAT has a smaller storage capacity than the main ERAT;
indicating an I-ERAT hit based on determining that an instruction address for an instruction cache is stored in the I-ERAT;
bypassing an arbitrator within the one or more processors and sending a translated address from the I-ERAT to the instruction cache based on detecting the I-ERAT hit; and
sending an address translation request through the arbitrator to the main ERAT based on an I-ERAT miss and writing a translation result of the main ERAT to the I-ERAT.

### Claim 16 (depends on 15)

The computer program product of claim 15, wherein the one or more processors comprise an instruction fetch unit (IFU) and a load store unit (LSU).

### Claim 17 (depends on 16)

The computer program product of claim 16, wherein the I-ERAT is distributed between the IFU and the LSU with effective addresses stored in the IFU and real addresses stored in the LSU.

### Claim 18 (depends on 17)

The computer program product of claim 17, wherein the LSU comprises the arbitrator and the main ERAT.

### Claim 19 (depends on 15)

The computer program product of claim 15, wherein address translation through the I-ERAT completes at least two cycles faster than through the arbitrator and the main ERAT.

### Claim 20 (depends on 15)

The computer program product of claim 15, wherein at least one of the one or more processors is a multi-thread processor and address mapping through the I-ERAT is based on a number of threads.
