Performance of Demand Paging
Duration: 4 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Reasoning Ability: Inequality, Syllogisms, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Series (Number and Letter Series) (Numerical Relations and Reasoning), Seating Arrangements, Puzzle Solving (Puzzles), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Sufficiency, Data Arrangement, Machine Input-Output
- Computer Aptitude: Logic Gates & Hardware, Number System, Number Representation, Basics of COA, Introduction to OS, Windows OS, Linux OS, Security, Virtual Memory, Introduction to CN, Hardware basics, Network Security, Basics of DBMS, Website, Browser & Services, Internet Fundamentals, Server Side & Security, Emerging Technologies, MS Office Applications
- Data Analysis & Interpretation: Data Interpretation
- General Awareness / Banking Awareness: Evolution of Indian Banking (Banking & Financial Awareness)
- English Language: Noun, Pronoun, Adjectives, Articles, Verb, Tenses, Subject Verb Agreement (Verb Noun Agreement), Adverb, Preposition, Conjunction, Modals, Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Verbal Analogy (Word Based Analogy), English Writing Ability
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The lecture focuses on calculating the effective access time in demand paging systems, a critical performance metric in operating systems. The instructor introduces the fundamental formula: Effective Access Time = (1 - p) * ma + p * page fault service time. He meticulously defines 'p' as the page fault rate or probability of a page fault occurring, and 'ma' as the standard memory access time. Through a detailed numerical example, he demonstrates how a relatively low page fault rate can drastically increase the effective access time compared to the base memory access time, highlighting the performance penalty associated with page faults.
Chapters
0:00 – 2:00 00:00-02:00
The instructor introduces the formula for "Effective Access time for Demand Paging" displayed on the slide: (1 - p) x ma + p x page fault service time. He defines 'p' as the page fault rate or probability of a page fault and 'ma' as memory access time. He begins a numerical example on the whiteboard, assigning values: ma = 10, page fault service time = 1000, p = 0.01, and (1-p) = 0.99. He calculates the first term as 0.99 * 10 = 9.9 and the second term as 0.01 * 1000 = 10. Finally, he sums these values to get an effective access time of 19.9, circling the result on the board. He underlines the terms in the formula to show correspondence with the numbers. He writes "lo" under ma and "1000" under page fault service time.
2:00 – 3:45 02:00-03:45
The instructor analyzes the result of the calculation, pointing to the formula components on the slide. He highlights that despite a low page fault rate of 1%, the effective access time nearly doubles from 10 to 19.9 due to the high cost of page fault service time (1000). He emphasizes the importance of minimizing page faults to maintain system performance. He gestures towards the written calculation to reinforce the mathematical derivation. The lecture concludes this segment by solidifying the relationship between page fault rates and overall memory performance. He explains that the "1000" represents the time taken to bring a page from disk, which is much slower than memory access. He points to the "19.9" result to show the final effective time.
The lesson effectively bridges theoretical formulas with practical numerical application. By calculating the effective access time, students learn that even rare page faults can significantly degrade performance because the service time is much higher than standard memory access. This underscores the critical need for efficient page replacement algorithms in operating systems to keep the page fault rate low.

