# US 2019/0377686 A1 · Arithmetic processor, information processing apparatus, and control method of arithmetic processor

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

- Number: US 2019/0377686 A1
- Document ID: US20190377686A1
- Status: Published application
- Kind: A1
- Application number: 16/418,018
- Filed: 2019-05-21
- Published: 2019-12-12
- Earliest claimed: 2018-06-07
- Assignees: Fujitsu Limited
- Applicants: Fujitsu Limited
- Inventors: Yuji Shirahige
- Web page: https://patentgrep.com/patent/US20190377686A1

## CPC

- G06F 12/1009: using page tables, e.g. page table structures
- G06F 12/0875: with dedicated cache, e.g. instruction or stack
- G06F 12/0891: using clearing, invalidating or resetting means
- G06F 12/1027: using associative or pseudo-associative address translation means, e.g. translation look-aside buffer [TLB]
- G06F 12/1063: {the data cache being concurrently virtually addressed}
- G06F 2212/1024: Latency reduction
- G06F 2212/651: Multi-level translation tables
- G06F 2212/683: Invalidation
- G06F 2212/684: TLB miss handling
- 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

A request generation circuit generates an information request including a request address. A translation buffer associates a virtual address of a page with a physical address (PA) of the page and stores the associated addresses. A page-table buffer associates data in a page table in a level other than the last level with PA of the data and stores the associated data and address. A controller circuit obtains, from the request address, PA of data in a page table to be accessed when the request address is not stored in the translation buffer. The controller circuit searches in the page-table buffer for the data when the page table to be accessed is in a level other than the last level. Meanwhile, the controller circuit obtains the data from a memory when the page table to be accessed is in the last level and registers the data in the translation buffer.

## Claims

### Claim 1

An arithmetic processor, comprising:
a request generation circuit configured to generate a information request including a request address;
a translation buffer configured to associate a virtual address of a page with a physical address of the page and to store the virtual address and the physical address;
a page-table buffer configured to associate data in a page table in a level other than a last level with a physical address of the data in the page table and to store the data in the page table and the physical address of the data in the page table; and
a controller circuit configured to obtain, from the request address, a physical address of data in a page table to be accessed when a virtual address that corresponds to the request address is not stored in the translation buffer, to search in the page-table buffer for the data in the page table to be accessed when the page table to be accessed is a page table in a level other than the last level, to obtain, from a memory, the data in the page table to be accessed when the page table to be accessed is a page table in the last level, and to register, in the translation buffer, a virtual address and a physical address of a page indicated by the obtained data.

### Claim 2 (depends on 1)

The arithmetic processor according to claim 1, wherein
the page-table buffer includes a plurality of entries and a control queue,
each of the plurality of entries includes data in a page table and a physical address of the data in the page table,
the controller circuit obtains, from the memory, the data in the page table to be accessed and outputs the data in the page table to be accessed to the page-table buffer when the page table to be accessed is a page table in a level other than the last level and the physical address of the data in the page table to be accessed is not stored in the page-table buffer,
the control queue stores an order of use of the plurality of entries and outputs a control signal indicating a least recently used entry from among the plurality of entries, and
the page-table buffer registers in the entry indicated by the control signal the data in the page table to be accessed and the physical address of the data in the page table to be accessed.

### Claim 3 (depends on 2)

The arithmetic processor according to claim 2, wherein
the translation buffer outputs an erase signal to the page-table buffer when a virtual address and a physical address in the translation buffer are invalidated, and
the page-table buffer invalidates all entries in the page-table buffer in response to the erase signal.

### Claim 4 (depends on 1)

The arithmetic processor according to claim 1, wherein
the memory is a cache memory or a main memory.

### Claim 5

An information processing apparatus, comprising:
a main memory configured to store information and a page table;
a request generation circuit configured to generate an information request including a request address, a translation buffer configured to associate a virtual address of a page with a physical address of the page and to store the virtual address and the physical address;
a page-table buffer configured to associate data in a page table in a level other than a last level with a physical address of the data in the page table and to store the data in the page table and the physical address of the data in the page table; and
a controller circuit configured to obtain, from the request address, a physical address of data in a page table to be accessed when a virtual address that corresponds to the request address is not stored in the translation buffer, to search in the page-table buffer for the data in the page table to be accessed when the page table to be accessed is a page table in a level other than the last level, to obtain, from the main memory, the data in the page table to be accessed when the page table to be accessed is a page table in the last level, and to register, in the translation buffer, a virtual address and a physical address of a page indicated by the obtained data.

### Claim 6 (depends on 5)

The information processing apparatus according to claim 5, wherein
the page-table buffer includes a plurality of entries and a control queue,
each of the plurality of entries includes data in a page table and a physical address of the data in the page table,
the controller circuit obtains, from the main memory, the data in the page table to be accessed and outputs the data in the page table to be accessed to the page-table buffer when the page table to be accessed is a page table in a level other than the last level and the physical address of the data in the page table to be accessed is not stored in the page-table buffer,
the control queue stores an order of use of the plurality of entries and outputs a control signal indicating a least recently used entry from among the plurality of entries, and
the page-table buffer registers in the entry indicated by the control signal the data in the page table to be accessed and the physical address of the data in the page table to be accessed.

### Claim 7 (depends on 6)

The information processing apparatus according to claim 6, wherein
the translation buffer outputs an erase signal to the page-table buffer when a virtual address and a physical address in the translation buffer are invalidated, and
the page-table buffer invalidates all entries in the page-table buffer in response to the erase signal.

### Claim 8

A control method of an arithmetic processor, comprising:
generating an information request including a request address;
obtaining, from the request address, a physical address of data in a page table to be accessed when a virtual address that corresponds to the requested address is not stored in a translation buffer that associates a virtual address of a page with a physical address of the page and stores the virtual address and the physical address;
searching, in a page-table buffer that associates data in a page table in a level other than a last level with a physical address of the data in a page table in a level other than the last level, for the data in the page table to be accessed when the page table to be accessed is a page table in a level other than the last level; and
obtaining, from a memory, the data in the page table to be accessed when the page table to be accessed is a page table in the last level and registering, in the translation buffer, a virtual address and a physical address of a page indicated by the obtained data.

### Claim 9 (depends on 8)

The control method of the arithmetic processor according to claim 8, further comprising:
obtaining, from the memory, the data in the page table to be accessed and outputting the data in the page table to be accessed to the page-table buffer when the page table to be accessed is a page table in a level other than the last level and the physical address of the data in the page table to be accessed is not stored in the page-table buffer; and
registering, in a least recently used entry that is indicated by a control signal output from a control queue that stores an order of use of a plurality of entries in the page-table buffer, the data in the page table to be accessed and the physical address of the data in the page table to be accessed.

### Claim 10 (depends on 9)

The control method of the arithmetic processor according to claim 9 further comprising:
outputting an erase signal to the page-table buffer from the translation buffer when a virtual address and a physical address in the translation buffer are invalidated; and
invalidating an entry in the page-table buffer in response to the erase signal.

### Claim 11 (depends on 8)

The control method of the arithmetic processor according to claim 8, wherein
the memory is a cache memory or a main memory.
