Multilevel Paging

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/ASRB-ICAR-T3-T4-INFORMATION-TECHNOLOGY-PRELIMS-MAINS/operating-system/memory-management/multilevel-paging/asset-multilevel-paging after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Prelims: General Knowledge: Physics Chemistry Biology History Geography Polity Indian Economy Static General Knowledge GK- Current Affairs Environment
  2. Prelims: General English: Vocabulary Noun Pronoun Adjectives Preposition Articles Direct and Indirect Speech Tenses Conjunction Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Sentence Correction (Error Correction) Sentence Completion (Fill in the blanks) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Cloze Test (Cloze Passage) Verbal Analogy (Word Based Analogy) Sentence Construction Adverb Verb
  3. Prelims: Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) HCF LCM Divisibility Rules Average Sequence and Series (Series) Number System Powers and Exponents (Surds and Indices) Algebra Profit and Loss Simple Interest and Compound Interest Time and Work Pipe and Cistern Speed Time and Distance Mixture and Alligation Mensuration and Geometry Age Problems Partnership Statistics Data Interpretation Arithmetic
  4. Prelims: General Agriculture: Agriculture in India and Tripura Natural Resource Management Fundamentals of Crop Production Horticulture Crop Improvement Crop Protection Social Science
  5. IT Mains: Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management Distributed Systems
  6. IT Mains: Computer Networking: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control Data Link Layer - Ethernet Net Layer: IPv4 & Proto Net Layer: IP Addressing Net Layer:Routing Protocol Transport Layer Services TL: Congestion & UDP Application Layer Hardware Basics Network Security
  7. IT Mains: DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery Big Data Systems Database Security & Authorization Enhanced Data Models NoSQL
  8. IT Mains: Software Engineering: Fundamentals of Software Engineering Software Requirements and Quality Assurance Software Design, Estimation and Metrics Software Testing Software Maintenance and Configuration Management
  9. IT Mains: Data Structures & Algorithms: Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing Algorithm Analysis Time Complexity Analysis Sorting Algorithms
  10. IT Mains: OOPS with C++ & Java: C Fundamentals OOPS with C++ Java Fundamentals Array, String, IO & References OOPS with Java Generic & Collections Multithreading File Handling & I/O
  11. IT Mains: Python: Introduction to Python Tokens, Variables, Data Types, I/O Operators & Expressions Control Flow & Looping Collections & Strings Functions & Modules
  12. IT Mains: Website Development: Website, Browser & Services Internet Fundamentals Web Design & Development Protocols & Services Web Publishing & Hosting Server Side & Security Emerging Technologies HTML Basics HTML5 CSS JavaScript-Basics .Net Programming PHP
  13. IT Mains: Mobile App Development: Mobile Computing Multimedia
  14. IT Mains: Linux / Windows Server Admin: Unix OS Linux OS
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture addresses the memory management challenge posed by modern systems supporting large logical address spaces ranging from 2^32 to 2^64 bits. The instructor begins by illustrating the problem: a single page table for such a system could contain millions of entries, making it impossible to fit into a single memory frame. He introduces the solution known as Multilevel Paging or Hierarchical Paging. This method involves dividing the page table into smaller pieces, effectively paging the page table itself. The specific implementation discussed is a two-level paging algorithm. A 32-bit logical address is segmented into three distinct parts: the first 10 bits serve as an index for the outer page table, the next 10 bits index the inner page table, and the final 12 bits act as the offset within the physical page frame. This hierarchical approach ensures that only the necessary portions of the page table reside in memory at any given time.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor starts the session by drawing a tall vertical rectangle on the whiteboard and labeling it 5m to represent a page table with 5 million entries. He explains that in modern systems, the logical address space is so large that the page table becomes excessively big. He draws a second, smaller rectangle next to the first one to visually contrast the sizes. He then begins sketching a system diagram on the left side of the board, drawing a box labeled CPU and connecting it to memory structures. This visual setup prepares the ground for explaining why a single large page table is problematic for memory allocation. He emphasizes that the page table itself takes up a lot of space in memory.

  2. 2:00 – 5:00 02:00-05:00

    He continues the whiteboard diagram by adding a PTBR Page Table Base Register box that points to a structure labeled Outer Page Table. He draws a second structure below it labeled Inner Page Table and uses arrows to show the data flow from the CPU through these tables to the main memory. He writes V3 < 4 P > I on the board, likely referring to virtual page number logic or a specific addressing scheme. He explains that the page table itself is paged, meaning it is divided into smaller pieces that can be loaded into memory frames as needed. This avoids the requirement for a contiguous block of memory for the entire page table, solving the space issue. He draws squiggly lines to represent the memory frames being filled.

  3. 5:00 – 7:36 05:00-07:36

    The video transitions to a slide titled Multilevel Paging Hierarchical Paging. The text on the slide explicitly states that page tables can contain millions of entries and cannot be accommodated into a single frame. The diagram on the slide shows a 32-bit logical address divided into 10 bits, 10 bits, and 12 bits. The instructor points to the Outer Page Table and Inner Page Table columns, explaining how the first 10 bits index the outer table, the next 10 bits index the inner table, and the final 12 bits provide the offset within the physical page. He traces the path from the CPU through the page tables to the physical memory, reinforcing the concept of hierarchical lookup. The slide also shows the physical address being split into 32 bits for the frame number and 12 bits for the offset.

The lesson progresses from identifying the memory inefficiency of large page tables to implementing a hierarchical solution. By breaking the page table into multiple levels, the system only needs to load the necessary parts of the page table into memory, saving significant space. The 32-bit address example concretely demonstrates how bits are allocated to navigate this hierarchy. This approach allows operating systems to manage very large address spaces efficiently without wasting memory on unused page table entries. The instructor effectively uses both hand-drawn diagrams and a structured slide to clarify the complex mapping process involved in multilevel paging.

Loading lesson…