Address Range Based Memory Hints for Prefetcher, Cache and Memory Controller
US-2024385966-A1 · Nov 21, 2024 · US
US10445245B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10445245-B2 |
| Application number | US-201615384067-A |
| Country | US |
| Kind code | B2 |
| Filing date | Dec 19, 2016 |
| Priority date | Dec 31, 2007 |
| Publication date | Oct 15, 2019 |
| Grant date | Oct 15, 2019 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A method, system, and apparatus may initialize a fixed plurality of page table entries for a fixed plurality of pages in memory, each page having a first size, wherein a linear address for each page table entry corresponds to a physical address and the fixed plurality of pages are aligned. A bit in each of the page table entries for the aligned pages may be set to indicate whether or not the fixed plurality of pages is to be treated as one combined page having a second page size larger than the first page size. Other embodiments are described and claimed.
Opening claim text (preview).
We claim: 1. A system, comprising: one or more processors; a system memory coupled to the one or more of the processors over a first bus; at least one of the processors comprising: a plurality of cores, one or more of the plurality of cores including execution resources to execute instructions; an instruction address translation circuit coupled to the one or more of the plurality of cores to perform address translations for instructions, the instruction address translation circuit to translate virtual addresses to physical addresses of memory pages containing the instructions; a data address translation circuit coupled to the one or more of the plurality of cores to perform address translations for data, the data address translation circuit to translate virtual addresses to physical addresses of memory pages containing the data; and one or both of the instruction address translation circuit and the data address translation circuit storing a plurality of entries, one or more of the entries to contain at least one virtual to physical address translation, the plurality of entries including a first plurality of entries and a second plurality of entries, the second plurality of entries corresponding to memory pages having different sizes than memory pages corresponding to the first plurality of entries, one or more of the cores to set one or more bits in the plurality of entries to identify a page size associated with a memory page, the one or more bits to distinguish between 4 Kbyte pages, 64 Kbyte pages, and 4 Mbyte pages, wherein a plurality of sequential 4 Kbyte pages having corresponding consecutive entries from the plurality of entries are to be combined into and treated as the 64 Kbyte pages or the 4 Mbyte pages; wherein an entry is to further include: a cacheable indication to identify whether a memory page associated with the entry is cacheable; and one or more supervisor/user indications to identify types of execution modes in which the memory page may be read and written. 2. The system as in claim 1 further comprising: a first fully associative memory to store the address translations for the data address translation circuit and a second fully associative memory to store the address translations for the instruction address translation circuit. 3. The system as in claim 2 further comprising: a page table walker to access page tables in memory in response to detecting that an address translation is not stored in the first or second fully associative memories. 4. The system as in claim 3 wherein the page tables comprise multi-level page tables. 5. The system as in claim 4 wherein one or more levels of the multi-level page tables are accessed using a base value and an offset value derived or read from a virtual address. 6. The system as in claim 1 wherein the one or more bits are to distinguish between 4 Kbyte pages, 64 Kbyte pages, 4 Mbyte pages, and pages having one or more other page sizes. 7. The system as in claim 1 further comprising: a storage device coupled to the one or more processors over a second bus. 8. The system as in claim 1 further comprising: a network device coupled to one or more of the processors. 9. A system comprising: one or more processors; system memory means coupled to the one or more of the processors over a first bus; at least one of the processors comprising: means for executing instructions on execution resources of one or more cores; instruction address translation means for performing address translations for instructions, wherein performing address translations includes translating virtual addresses to physical addresses of memory pages containing the instructions; data address translation means for performing address translations for data, wherein performing address translations includes translating virtual addresses to physical addresses of memory pages containing the data; wherein performing the address translations further includes performing a lookup on a plurality of entries, one or more of the entries to contain at least one virtual to physical address translation, the plurality of entries including a first plurality of entries and a second plurality of entries, the second plurality of entries corresponding to memory pages having different sizes than memory pages corresponding to the first plurality of entries; and means for setting one or more bits in the plurality of entries to identify a page size associated with a memory page, the one or more bits to distinguish between 4 Kbyte pages, 64 Kbyte pages, and 4 Mbyte pages, wherein a plurality of sequential 4 Kbyte pages having corresponding consecutive entries from the plurality of entries are to be combined into and treated as the 64 Kbyte pages or the 4 Mbyte pages; wherein an entry is to further include: a cacheable indication to identify whether a memory page associated with the entry is cacheable; and one or more supervisor/user indications to identify types of execution modes in which the memory page may be read and written. 10. The system as in claim 9 further comprising: means for storing the address translations for data in a first fully associative memory; and means for storing the address translations for instructions in a second fully associative memory. 11. The system as in claim 10 further comprising: means for performing a page walk to access page tables in memory in response to detecting that an address translation is not stored in the first or second fully associative memories. 12. The system as in claim 11 wherein the page tables comprise multi-level page tables. 13. The system as in claim 12 wherein one or more levels of the multi-level page tables are accessed using a base value and an offset value derived or read from a virtual address. 14. The system as in claim 9 wherein the one or more bits are to distinguish between 4 Kbyte pages, 64 Kbyte pages, 4 Mbyte pages, and pages having one or more other page sizes. 15. The system as in claim 9 further comprising: storage means coupled to the one or more processors over a second bus. 16. The system as in claim 9 further comprising: network means coupled to one or more of the processors.
Way prediction in set-associative cache · CPC title
Details of translation look-aside buffer [TLB] · CPC title
using associative or pseudo-associative address translation means, e.g. translation look-aside buffer [TLB] · CPC title
Virtualized environment, e.g. logically partitioned system · CPC title
using pseudo-associative means, e.g. set-associative or hashing · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.