Replacing pointers with hashing in tree-based page table designs
AssigneeAdvanced Micro Devices, Inc.
InventorAlexander D. Breslow
Life of this patent
Estimating the term…
Abstract
A device includes an address translation table to, in each node of a set of nodes in the address translation table, store a key value and a hash function identifier, a hash engine coupled with the address translation table to, for each node in the set of nodes, calculate a hash result for the key value by executing a hash function identified by the hash function identifier, and a processing unit coupled with the hash engine to, in response to a request to translate a virtual memory address to a physical memory address, identify a physical memory region corresponding to the virtual memory address based on the calculated hash result for each node in the set of nodes.
Claims20
A device, comprising:
- an address translation table configured to, in each node of a set of nodes in the address translation table, store a key value and a hash function identifier;
- a hash engine coupled with the address translation table and configured to, for each node in the set of nodes, calculate a hash result for the key value by executing a hash function identified by the hash function identifier;
- and
- a processing unit coupled with the hash engine and configured to, in response to a request to translate a virtual memory address to a physical memory address, identify a physical memory region corresponding to the virtual memory address based on the calculated hash result for each node in the set of nodes.
A method, comprising:
- in each node of a set of nodes in an address translation table, storing a key value and a hash function identifier;
- for each node in the set of nodes, calculating a hash result for the key value by executing a hash function identified by the hash function identifier;
- and
- in response to a request to translate a virtual memory address to a physical memory address, identifying a physical memory region corresponding to the virtual memory address based on the calculated hash result for each node in the set of nodes.
A computing system, comprising:
- a memory system configured to store an address translation table, wherein the address translation table is configured to, in each node of a set of nodes in the address translation table, store a key value and a hash function identifier;
- a processing unit configured to,
- for each node in the set of nodes, calculate a hash result for the key value by executing a hash function identified by the hash function identifier;
- and
- in response to a request to translate a virtual memory address to a physical memory address, identify a physical memory region in the memory system corresponding to the virtual memory address based on the calculated hash result for each node in the set of nodes.
Dependencies are inferred from the claim text.