Patentable/Patents/US-11954044
US-11954044

Translation lookaside buffer prewarming

PublishedApril 9, 2024
Assigneenot available in USPTO data we have
Inventorsnot available in USPTO data we have
Technical Abstract

A method includes executing, by a processor core, a first task; scheduling, by a scheduler, a second task to be executed by the processor core upon completion of executing the first task; responsive to scheduling the second task, providing, by the scheduler, a prewarming message to a memory management unit (MMU) coupled to the processor core; and responsive to receiving the prewarming message, fetching, by the MMU, a page table specified by a page table base of the prewarming message.

Patent Claims
8 claims

Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.

Claim 2

Original Legal Text

2. The method of claim 1, wherein the specified page table is stored in a main memory coupled to the MMU and the fetching further comprises caching the page table in a cache between the main memory and the processor core.

Plain English Translation

This invention relates to memory management in computing systems, specifically improving the efficiency of page table access in a memory management unit (MMU). The problem addressed is the latency and performance overhead associated with frequently accessing page tables stored in main memory, which can slow down processor operations. The invention describes a method for managing memory access in a computing system where a processor core accesses a page table stored in main memory via a memory management unit (MMU). The method includes fetching the page table from main memory and caching it in a dedicated cache located between the main memory and the processor core. This intermediate cache reduces the latency of page table lookups, improving overall system performance by minimizing the time spent waiting for memory access. The page table contains mappings between virtual addresses used by the processor and physical addresses in main memory. By caching the page table, the system avoids repeatedly accessing slower main memory for each address translation, instead retrieving the necessary mappings from the faster cache. This is particularly beneficial in systems where frequent memory access operations occur, such as in virtualized environments or high-performance computing applications. The caching mechanism ensures that commonly accessed page table entries are readily available, reducing the overhead of address translation and improving system responsiveness.

Claim 6

Original Legal Text

6. The method of claim 1, wherein the MMU receives the prewarming message directly from the scheduler.

Plain English Translation

A method for managing memory access in a computing system involves a memory management unit (MMU) that receives a prewarming message directly from a scheduler. The scheduler is responsible for allocating and managing computational resources, including memory, to optimize system performance. The prewarming message instructs the MMU to prepare specific memory regions for upcoming access by a processing unit, reducing latency when the processing unit subsequently requests access to those regions. This proactive approach minimizes delays caused by memory access bottlenecks, particularly in systems where memory access times are a significant performance constraint. The MMU, upon receiving the prewarming message, may preload data into cache, adjust memory mapping tables, or perform other preparatory steps to ensure efficient access. This method is particularly useful in high-performance computing environments, such as data centers, real-time systems, or applications requiring low-latency memory access. By integrating the scheduler and MMU, the system can anticipate memory needs and preemptively optimize access patterns, improving overall system efficiency and responsiveness.

Claim 7

Original Legal Text

7. The method of claim 1, wherein the processor core is a first processor core, the method further comprising executing, by a second processor core, a third task, wherein the scheduling of the second task to be executed by the first processor core upon completion of executing the first task is responsive to determining that the first processor core will complete executing the first task prior to the second processor core completing executing the third task.

Plain English Translation

This invention relates to task scheduling in multi-core processor systems, specifically optimizing task execution to improve efficiency and reduce latency. The problem addressed is inefficient task scheduling in multi-core environments, where tasks may be assigned without considering the completion times of other cores, leading to suboptimal performance. The method involves a multi-core processor system where tasks are dynamically scheduled based on predicted completion times across different cores. A first processor core executes a first task, while a second processor core executes a third task. The scheduling of a second task to the first core is conditioned on determining that the first core will finish the first task before the second core completes the third task. This ensures that the first core remains available to handle the second task promptly, avoiding idle time and improving overall throughput. The approach leverages real-time performance monitoring to predict task completion times and adjust scheduling decisions accordingly. By dynamically assigning tasks based on core availability and workload balance, the system minimizes delays and maximizes resource utilization. This method is particularly useful in real-time systems where task deadlines must be met, such as in embedded systems, automotive applications, or high-performance computing environments. The solution enhances efficiency by preventing unnecessary task migrations and reducing context-switching overhead.

Claim 9

Original Legal Text

9. The system of claim 8, further comprising a main memory coupled to the MMU and a cache between the main memory and the processor core, wherein the specified page table is stored in the main memory, and wherein the MMU is further configured to cache the page table in the cache.

Plain English Translation

This invention relates to memory management in computing systems, specifically addressing the efficiency of virtual-to-physical address translation. The system includes a memory management unit (MMU) that manages address translation between virtual addresses used by a processor core and physical addresses in main memory. The MMU uses a page table stored in main memory to perform these translations. To improve performance, the system includes a cache positioned between the main memory and the processor core, where the MMU is configured to cache the page table in this cache. This caching mechanism reduces the latency associated with accessing the page table from main memory, thereby accelerating address translation and improving overall system performance. The processor core executes instructions and accesses data using virtual addresses, while the MMU translates these virtual addresses to physical addresses using the cached page table entries. The cache stores frequently accessed page table entries, minimizing the need to fetch them from main memory. This approach enhances efficiency in systems where frequent memory access and address translation are critical, such as in high-performance computing or real-time processing environments.

Claim 13

Original Legal Text

13. The system of claim 8, wherein the MMU receives the prewarming message directly from the scheduler.

Plain English Translation

A system for managing memory access in a computing environment involves a memory management unit (MMU) that optimizes data retrieval by prewarming memory. The MMU receives a prewarming message directly from a scheduler, which coordinates task execution. The prewarming message instructs the MMU to load specific data into memory before it is requested by a processing unit, reducing latency and improving performance. The scheduler determines which data should be prewarmed based on task priorities, execution timelines, and memory availability. The MMU then fetches the data from storage and places it in a cache or main memory, ensuring it is readily available when needed. This approach minimizes delays caused by memory access bottlenecks, particularly in systems with high-performance requirements or real-time constraints. The direct communication between the scheduler and the MMU eliminates intermediate steps, further enhancing efficiency. The system is applicable in computing environments where rapid data access is critical, such as high-frequency trading, real-time analytics, or embedded systems.

Claim 14

Original Legal Text

14. The system of claim 8, wherein the processor core is a first processor core, the system further comprising a second processor core configured to execute a third task, wherein the scheduler schedules the second task to be executed by the first processor core upon completion of executing the first task responsive to a determination that the first processor core will complete executing the first task prior to the second processor core completing executing the third task.

Plain English Translation

A multi-core processing system optimizes task scheduling to improve efficiency by dynamically assigning tasks based on predicted execution times. The system includes multiple processor cores, each capable of executing tasks independently. A scheduler monitors task execution and predicts whether a first processor core will finish a first task before a second processor core completes a third task. If so, the scheduler assigns a second task to the first processor core immediately after the first task finishes, preventing idle time and maximizing core utilization. This approach reduces latency and improves throughput by ensuring tasks are executed in the most efficient sequence across available cores. The system is particularly useful in real-time or high-performance computing environments where minimizing idle cycles is critical. The scheduler may use historical performance data, task complexity analysis, or other predictive methods to make scheduling decisions. The invention addresses inefficiencies in traditional task scheduling where cores may wait for tasks unnecessarily, leading to suboptimal performance.

Claim 16

Original Legal Text

16. The non-transitory, computer-readable medium of claim 15, wherein the MMU is configured to couple to a main memory and to a cache between the main memory and the processor core, wherein the specified page table is stored in the main memory, and wherein the MMU is further configured to cache the page table in the cache.

Plain English Translation

This invention relates to memory management in computer systems, specifically addressing the efficiency of memory access and translation in systems with a memory management unit (MMU). The problem solved is the latency and overhead associated with accessing page tables stored in main memory, which can slow down processor performance. The invention improves this by caching the page table in a cache memory located between the main memory and the processor core. The MMU is configured to couple to both the main memory and the cache, allowing it to store and retrieve page table entries from the cache rather than repeatedly accessing the slower main memory. This reduces latency and improves system performance by minimizing the time spent on memory translations. The cache acts as an intermediary, storing frequently accessed page table entries to expedite address translations. The system ensures that the page table is initially stored in main memory but is dynamically cached in the cache memory for faster access. This approach optimizes memory management by leveraging the faster access times of cache memory while maintaining the integrity and availability of the page table in main memory. The invention is particularly useful in systems where memory access speed is critical, such as high-performance computing or real-time processing environments.

Claim 20

Original Legal Text

20. The non-transitory, computer-readable medium of claim 15, wherein the instructions, when executed, cause the processor to provide the prewarming message directly to the MMU.

Plain English Translation

A system and method for optimizing memory management unit (MMU) performance in computing systems. The invention addresses inefficiencies in MMU operations, particularly during context switching or memory access latency, by implementing a prewarming mechanism. The system includes a processor executing instructions stored on a non-transitory, computer-readable medium. The instructions configure the processor to monitor memory access patterns and predict future memory access requirements. Based on these predictions, the system generates a prewarming message containing data or instructions to be preloaded into the MMU. This prewarming message is provided directly to the MMU, reducing latency and improving performance by ensuring the MMU has the necessary data preloaded before it is required. The system may also include mechanisms to dynamically adjust the prewarming process based on real-time performance metrics, such as access frequency, latency, or system load. The invention enhances system responsiveness and efficiency by minimizing delays associated with MMU operations, particularly in high-performance computing environments.

Classification Codes (CPC)

Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.

Patent Metadata

Filing Date

October 12, 2020

Publication Date

April 9, 2024

Want to explore more patents?

Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.

Citation & reuse

Analysis on this page is generated by Patentable — an AI-powered patent intelligence platform. AI-generated summaries, explanations, FAQs, and analysis may be reused with attribution and a visible link back to the canonical URL below. Patent abstracts and claims are USPTO public domain.

Cite as: Patentable. “Translation lookaside buffer prewarming” (US-11954044). https://patentable.app/patents/US-11954044

© 2026 Nomic Interactive Technology LLC. Machine-readable context available at /api/llm-context/US-11954044. See llms.txt for full attribution policy.

Translation lookaside buffer prewarming