Skip to main content
Definition Website Computer and Technology

Translation Lookaside Buffer

Subject: Computer and Technology noun /trænzˈleɪ.ʃən ˈlʊk.əˌsaɪd ˈbʌf.ər/ 1 definition

  1. Definition (noun)

    Entry #104 · Updated

    A Translation Lookaside Buffer (TLB) is a specialized, high-speed hardware cache inside a processor's Memory Management Unit (MMU) that stores recent mappings between virtual memory pages and physical RAM frames. Because resolving a virtual address through multi-level page tables in main memory requires multiple slow memory accesses, the TLB accelerates translation by serving matching page table entries—including access permissions and status flags—in as little as a single clock cycle. Unlike general-purpose CPU caches (L1/L2/L3) that store program instructions and data, a TLB caches only address-translation metadata; when a requested mapping is absent (a TLB miss), a hardware page-table walker or operating system handler must consult the page tables in memory to retrieve and load the entry.

    Common Types

    • Split Level-1 TLBs (ITLB and DTLB): Dedicated fast-access buffers paired separately with the instruction fetch unit and the data load/store units so instruction and data translations occur concurrently without port contention.

    • Unified Level-2 TLB (STLB): A larger, set-associative shared cache that backs both the ITLB and DTLB, serving L1 misses in a few cycles before the CPU resorts to a main-memory page-table walk.

    • Tagged TLB (ASID/PCID): A buffer that attaches an Address Space Identifier (ASID) or Process-Context Identifier (PCID) to each entry, allowing translations from multiple processes or virtual machines to coexist across context switches without flushing the cache.

    • Software-Managed TLB: A design—used in architectures such as classic MIPS and SPARC—that raises a processor trap on a TLB miss so the operating system kernel walks its own page tables and reloads the buffer in software rather than relying on fixed hardware traversal logic.

    Example

    When an in-memory key-value store looks up keys across a 4 KB-paged hash table, each virtual address resolves in a single cycle whenever its page mapping is already cached in the CPU's DTLB. When execution touches a freshly mapped page for the first time, the resulting TLB miss prompts the hardware page-table walker to traverse the four-level x86-64 page table in RAM and cache the entry so subsequent accesses to that page avoid further walks.