Advantage and Disadvantage of Paging
Duration: 9 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Quantitative Aptitude and Math: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Algebra, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Statistics, Probability, Percentage, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Average, Calculus, Trigonometry, Vectors, Linear Algebra
- Logical and Analytical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Verbal Analogy (Word Based Analogy), Directions (Direction Test), Blood Relations, Ranking, Order and Sequence, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Puzzle Solving (Puzzles), Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning)
- English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Verb, Articles, Preposition, Pronoun, Conjunction, Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Cloze Test (Cloze Passage)
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
- Computer Networks: Introduction to CN, Data Communication, 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, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Cyber and Info Security
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- DBMS: 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, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The lecture provides a detailed analysis of the paging mechanism in operating systems, focusing on address translation, advantages, and significant disadvantages. The instructor uses diagrams to explain how logical addresses are mapped to physical addresses via a page table. Key topics include the removal of external fragmentation, the overhead of double memory access during translation, the space required for page tables, and the issue of internal fragmentation caused by fixed-size partitions.
Chapters
0:00 – 2:00 00:00-02:00
The instructor begins by analyzing a detailed diagram illustrating the paging mechanism. The diagram displays a 'CPU' block connected to a 'logical address' split into 'p' (page number) and 'd' (offset). He explains that 'p' indexes into a 'page table' to retrieve a frame number 'f'. This 'f' is then combined with 'd' to form the 'physical address'. The diagram shows the flow from logical address to physical memory and secondary memory, with labels like 'f0000...0000' and 'f1111...1111' indicating address ranges. He highlights a slide titled 'Advantage' with the text 'Removal of External Fragmentation', indicating that paging solves the problem of external fragmentation found in contiguous memory allocation. He gestures towards the page table structure, emphasizing its role in mapping logical pages to physical frames, and explains how the offset 'd' remains unchanged during translation.
2:00 – 5:00 02:00-05:00
The lecture transitions to the 'Disadvantage' slide. The first point states, 'Translation process is slow as Main Memory is accessed two times'. The instructor writes 'MM + MM' on the screen to visualize these two accesses: one to fetch the page table entry and another to access the actual data. He then addresses the second disadvantage: space wasted in the page table. He performs a calculation on the board, writing 'P = 1GB' and 'PS = 1KB' (Page Size). He calculates the number of pages as 2^30 / 2^10 = 2^20. Assuming 4 bytes per entry, he derives a page table size of roughly 4MB. He mentions 'TLB' (Translation Lookaside Buffer) as a hardware solution to mitigate the speed issue caused by double memory access. He points to the slide text 'A considerable amount of space a waisted in storing page table(meta data)' to reinforce the overhead cost.
5:00 – 8:32 05:00-08:32
The instructor continues discussing the disadvantages, specifically focusing on internal fragmentation. He points to the slide text: 'System suffers from internal fragmentation(as paging is an example of fixed size partition).' He explains that since pages are fixed-size, the last page of a process might not be fully utilized, leading to wasted space within the allocated frame. He draws a diagram of physical memory blocks to illustrate this concept, showing how a process might occupy a frame but leave some bytes unused. He also touches upon the final point on the slide: 'Translation process is difficult and complex to understand and implement.' He emphasizes that while paging removes external fragmentation, it introduces internal fragmentation and overhead, making the memory management system more complex compared to simpler allocation schemes. He concludes by reiterating that the complexity lies in managing these page tables and handling the translation overhead efficiently.
The video effectively bridges theoretical concepts with practical implications of paging. By calculating page table sizes and illustrating memory access patterns, the instructor clarifies why paging, despite solving external fragmentation, introduces new challenges like internal fragmentation and performance overhead. The discussion on TLB and complexity provides a holistic view of memory management trade-offs.

