Загрузка...

What is a Page Fault

A page fault is a type of exception generated by the processor when a program tries to access a portion of memory that is not currently loaded into physical RAM.

SUMMARY
In modern operating systems that use virtual memory, data is organized into fixed-size blocks called pages, which can be stored either in RAM or on disk. To access data, it must be loaded into RAM. So when a required page is not in RAM, the processor triggers a page fault to bring the requested page from disk.
There are two types of page faults:
• Minor (Soft) Page Fault: The accessed data is already in RAM but hasn’t yet been mapped into the virtual memory space of the process.
• Major (Hard) Page Faults: The requested data is not in RAM and must be loaded from disk before the process can continue.
If a program tries to access invalid memory (the address isn’t mapped in its virtual address space and isn’t found in either RAM or on disk), the page fault handler typically asks the operating system to terminate the offending program with the infamous “Segmentation Fault” error.

LINKS
📚 Computer Memory and Architecture E-Book Collection: https://buymeacoffee.com/bitlemonsoftware/e/427972
📚 Inside the Core: How the CPU Works (E-Book): https://buymeacoffee.com/bitlemonsoftware/e/467679
📚 Interrupts in Modern Computer Systems (E-Book): https://buymeacoffee.com/bitlemonsoftware/e/420320
📚 The Anatomy of Virtual Memory (E-Book): https://buymeacoffee.com/bitlemonsoftware/e/400638
📚 Beginner's Guide to CPU Caches (E-Book): https://buymeacoffee.com/bitlemonsoftware/e/362123
❤ Support my work: https://buymeacoffee.com/bitlemonsoftware

SOURCES
The information in this video is based on my own book - "The Anatomy of Virtual Memory".

TABLE OF CONTENTS
00:00 What is a page fault?
00:27 Page fault handling (ISR)
00:51 Minor (soft) page faults
01:37 Major (hard) page faults
02:04 Accessing invalid memory
02:22 The Anatomy of Virtual Memory (e-book)

ATTRIBUTION
Some of the elements in the video were designed by vectorpocket / macrovector / rawpixel.com / Freepik at freepik.com.

#computerscience #memorymanagement #virtualmemory #operatingsystem #pagetables #pagefault

Видео What is a Page Fault канала BitLemon
virtual memory what is virtual memory virtual memory vs physical memory virtual memory explained physical memory virtual memory paging virtual memory explanation memory virtual memory in os page tables page table how paging works page fault pages page faults what is a page fault page fault in os page fault explained page faults explained how page faults work page faults in operating system operating system page fault handler page faults in os os
Комментарии отсутствуют
Зарегистрируйтесь или войдите с
Информация о видео
29 мая 2025 г. 23:53:55
00:02:50
BitLemon
Теги
Правообладателям
Жалоба на материал Недопустимый материал Нарушение авторских прав
Комментарии
Поделиться
Другие видео канала

Binary Search Tree in C++: Getting the Level of a Specific Node in the TreeBinary Search Tree in C++: Getting the Level of a Specific Node in the Tree

Bitwise Operations: The Most Underappreciated Feature in Low-Level ProgrammingBitwise Operations: The Most Underappreciated Feature in Low-Level Programming

Cache Simulator in C++: Building a Basic FrameworkCache Simulator in C++: Building a Basic Framework

Binary Search Tree in C++: Tree Depth and Tree SizeBinary Search Tree in C++: Tree Depth and Tree Size

Binary Search Tree in C++: Removing a Node from the TreeBinary Search Tree in C++: Removing a Node from the Tree

Binary Search Tree in C++: Checking if Trees Are IdenticalBinary Search Tree in C++: Checking if Trees Are Identical

Binary Search Tree in C++: Implementing a Basic Tree (Insert, Search & Inorder Traversal)Binary Search Tree in C++: Implementing a Basic Tree (Insert, Search & Inorder Traversal)

Binary Search Tree in C++: Releasing Memory Allocated by the TreeBinary Search Tree in C++: Releasing Memory Allocated by the Tree

Binary Search Tree in C++: Finding the Minimum and Maximum Value Node in the TreeBinary Search Tree in C++: Finding the Minimum and Maximum Value Node in the Tree

Binary Search Tree in C++: How to Determine if a Binary Tree is Perfect or NotBinary Search Tree in C++: How to Determine if a Binary Tree is Perfect or Not

Why Programs Use Stack, Heap, and Other Memory SegmentsWhy Programs Use Stack, Heap, and Other Memory Segments

DMA Controller: How Peripheral Devices Transfer Data to RAMDMA Controller: How Peripheral Devices Transfer Data to RAM

Virtual Memory SegmentsVirtual Memory Segments

Cache Replacement Policies (LRU, Tree-pLRU, MRU, QLRU, FIFO, LFU, Random and more)Cache Replacement Policies (LRU, Tree-pLRU, MRU, QLRU, FIFO, LFU, Random and more)

Page Tables and MMU: How Virtual Memory Actually Works Behind the Scenes (Animation)Page Tables and MMU: How Virtual Memory Actually Works Behind the Scenes (Animation)

CPU Architecture ExplainedCPU Architecture Explained

Why Do CPU Caches Use 64-Byte Data Lines?Why Do CPU Caches Use 64-Byte Data Lines?

C++ Vectors Explained in 168 secondsC++ Vectors Explained in 168 seconds

CPU Cache Write Policies (Write Through, Write Back, Write Allocate, No Write Allocate)CPU Cache Write Policies (Write Through, Write Back, Write Allocate, No Write Allocate)

Cache Hierarchy: How Modern CPU Caches Are Organized (L1, L2 and L3)Cache Hierarchy: How Modern CPU Caches Are Organized (L1, L2 and L3)

Яндекс.Метрика
© 2008-2026 «Информационно-развлекательный портал города Верхняя Салда»
salda.ws@mail.ru salda_ws Контакты Карта портала Сообщить об ошибке Соглашения Пользовательское соглашение Соглашение о конфиденциальности Согласие на обработку персональных данных Информация для правообладателей Об использовании Cookies
Все заметки Новая заметка Страницу в заметки
Страницу в закладки Мои закладки
На информационно-развлекательном портале SALDA.WS применяются cookie-файлы. Нажимая кнопку Принять, вы подтверждаете свое согласие на их использование.
О CookiesНапомнить позжеПринять