Multilevel Paging

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/operating-system/memory-management/multilevel-paging/asset-multilevel-paging after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. Computer Networks: Introduction to CN, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory
  10. Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
  17. English (Verbal Ability): 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), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
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…