Multilevel Paging

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-PAPER-2/operating-system/memory-management/multilevel-paging/asset-multilevel-paging after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Programming, Data Structures, OOP & Java: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up, Object Oriented Technology
  3. Computer Networks, TCP/IP & Network Security: Introduction to CN, Data Communication, DLL: Flow Control, DLL: Access Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Access Technologies, Network Security, Society, Law & Ethics, Cloud Computing, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  4. Teaching Methodology: Child Development, Concept of Pedagogy, Theories, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Curriculum Framework & Reforms, National Education Policy (NEP) 2020, Psychology, Teaching-Learning Process, Personality Development, Teaching Methods & Strategies, Learning and Motivation, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Nature, Objectives & Characteristics of Teaching, Teaching-Learning Aids & ICT Integration, Classroom Management & Communication, Evaluation, Assessment & Measurement, Curriculum & School Environment, Inclusive Education & Special Needs, Professional Development & Ethics
  5. Digital Electronics / Boolean Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  6. Operating Systems & Linux: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, File Management, Disc Scheduling, Unix OS, Linux OS, Distributed Systems, Windows OS
  7. Data Base Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, File Organization & Indexing, Transaction Management, Concurrency Control, Database Security & Authorization, Database Recovery, Data Warehousing & Mining
  8. Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, HTML Basics, CSS, Emerging Technologies, JavaScript-Basics, .Net Programming, Electronic Data Interchange and E-Commerce, XML
  9. Computer Fundamentals, IT Basics & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer, Terms & Abbreviations, MS Office Applications, Instr Formats & Modes, Floating Point Rep
  10. Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  11. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, extras, Fundamentals of Systems and Information Systems
  12. Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  13. Mathematics - I, II, III, IV: Permutation and Combination, Logarithm, Linear Algebra, Algebra, Calculus, Trigonometry, Vectors, Set Theory, Functions, Relations, Propositional and Predicate Logic, Research Process Steps, Graph Theory
  14. Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  15. Emerging Trends: Emerging Tech Trends, Knowledge Representation, Natural Language Processing
  16. Statistical Techniques: Probability, Statistics
  17. Interpolation - DI: Data Interpretation
  18. Basis of Physics: Physics
  19. Previous Year Paper:
  20. Business Studies and Management: Business Communication, Business Organization and Management, Financial Accounting, Business Economics, Management Information System (MIS), Knowledge Management & New Economy
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…