Implementing LRU

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/COGNIZANT-PREPARATION/operating-systems/virtual-memory/lru-page-replacement/asset-implementing-lru after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Communication Round: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Direct and Indirect Speech, Active Passive Voice (Voice), Verbal Analogy (Word Based Analogy), Articles, Preposition, Conjunction, Sentence Construction, English Writing Ability, Communication Assessment
  2. Quantitative Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Speed Time and Distance, Percentage, Average, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Age Problems, Pipe and Cistern, Probability, Profit and Loss, Simple Interest and Compound Interest, Algebra
  3. Analytical and Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Puzzle Solving (Puzzles), Syllogisms, Seating Arrangements, Calendar, Clock, Blood Relations, Cubes & Dices, Venn Diagram, Analytical Reasoning (Counting Figures Reasoning)
  4. Cognizant Gaming Aptitude: Gamified / Game Based Aptitude
  5. Java (Cluster 1): Java
  6. ANSI SQL MySQL (Cluster 1,2,3): SQL
  7. HTML, CSS, JavaScript (Cluster 1,3): HTML, CSS, JavaScript
  8. Python (Cluster 2): Python for Placements by Yash Sir
  9. Cloud Fundamentals (Cluster 2): Emerging Tech Trends
  10. C# (Cluster 3): C#
  11. OOPs: Object Oriented Programming (OOPS)
  12. Technical Assessment (Coding): Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Pseudo Codes
  13. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. DBMS: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, 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
  15. Operating Systems: 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
  16. 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, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture details two specific algorithms for implementing the Least Recently Used (LRU) page replacement strategy in operating systems. The first method discussed involves using counters, where a logical clock is associated with page-table entries to track usage time. The second method utilizes a stack data structure to maintain the order of page references. The instructor uses a whiteboard to visually demonstrate how these mechanisms function in practice, drawing tables and stack diagrams to clarify the replacement logic. He emphasizes that the goal is to identify the page that has not been used for the longest period to free up memory space efficiently.

Chapters

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

    The segment begins with the instructor explaining the Counters implementation. The slide text states, In the simplest case, we associate with each page-table entry a time-of-use field and add to the CPU a logical clock or counter. He elaborates that the clock increments for every memory reference, and the current clock value is copied to the page-table entry. To illustrate this, he draws a table on the whiteboard with a column labeled P for pages and a column for time values. He writes numbers like 8, 7, 6, and 5 in the boxes, explaining that the page with the smallest time value, such as 5, is the candidate for replacement because it was the least recently used. He points to the text We replace the page with the smallest time value to reinforce the concept.

  2. 2:00 – 3:57 02:00-03:57

    The lecture transitions to a second approach titled Stack on the slide. The text reads, Another approach to implementing LRU replacement is to keep a stack of page numbers. The instructor explains that whenever a page is referenced, it is removed from its current position in the stack and placed on the top. He draws a U-shaped diagram on the whiteboard to represent the stack structure. He points out that the most recently used page is always at the top, while the least recently used page remains at the bottom, making it the ideal candidate for replacement when a new page needs to be loaded into memory. He underlines the phrase removed from the stack and put on the top to highlight the dynamic nature of this data structure.

The lesson effectively contrasts two hardware-assisted methods for LRU replacement. While counters provide a direct timestamp for each page, the stack method offers a structural approach where the order of elements inherently defines their recency. Both methods aim to minimize page faults by ensuring that the oldest, least utilized pages are evicted first, maintaining system performance.

Loading lesson…