Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Virtual Memory: Address Translation and Page Tables

Description

This lecture covers the concepts of virtual memory systems, address translation, and page tables. It explains the properties of virtual and physical addresses, page sizes, and hierarchical address translation schemes. The lecture also delves into the calculation of offset field size, the number of virtual and physical pages, and the capacity of physical memory. Additionally, it discusses the structure and content of page tables, including the size of directory fields. Practical exercises are provided to reinforce the understanding of these concepts.

Official source

Ontological neighbourhood

Computer engineering

High-performance computing: Real-time computing

Related concepts (32)

Page table

A page table is the data structure used by a virtual memory system in a computer operating system to store the mapping between virtual addresses and physical addresses. Virtual addresses are used by the program executed by the accessing process, while physical addresses are used by the hardware, or more specifically, by the random-access memory (RAM) subsystem. The page table is a key component of virtual address translation that is necessary to access data in memory.

Virtual memory

In computing, virtual memory, or virtual storage, is a memory management technique that provides an "idealized abstraction of the storage resources that are actually available on a given machine" which "creates the illusion to users of a very large (main) memory". The computer's operating system, using a combination of hardware and software, maps memory addresses used by a program, called virtual addresses, into physical addresses in computer memory.

Physical Address Extension

In computing, Physical Address Extension (PAE), sometimes referred to as Page Address Extension, is a memory management feature for the x86 architecture. PAE was first introduced by Intel in the Pentium Pro, and later by AMD in the Athlon processor. It defines a page table hierarchy of three levels (instead of two), with table entries of 64 bits each instead of 32, allowing these CPUs to directly access a physical address space larger than 4 gigabytes (232 bytes).

Physical address

In computing, a physical address (also real address, or binary address), is a memory address that is represented in the form of a binary number on the address bus circuitry in order to enable the data bus to access a particular storage cell of main memory, or a register of memory-mapped I/O device. In a computer supporting virtual memory, the term physical address is used mostly to differentiate from a virtual address.

Page (computer memory)

A page, memory page, or virtual page is a fixed-length contiguous block of virtual memory, described by a single entry in the page table. It is the smallest unit of data for memory management in a virtual memory operating system. Similarly, a page frame is the smallest fixed-length contiguous block of physical memory into which memory pages are mapped by the operating system. A transfer of pages between main memory and an auxiliary store, such as a hard disk drive, is referred to as paging or swapping.

Related lectures (32)

Memory Hierarchy and Cache Performance

Explores virtual memory, page tables, TLB, and cache memory in computer systems.

Virtual Memory: Hierarchical Structure and Translation

Explores virtual memory hierarchical structure, address translation, offset field sizes, page table size calculation, and Alpha Processor address generation.

Virtual Memory

Covers virtual memory, program relocation, memory protection, TLB, and memory hierarchy interactions.

Automatic Synthesis of OS Code

Covers the automatic synthesis of OS code to ease the burden of developers in configuring translation hardware.

Cache Memory