Local Vs Global Replacement

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/unit-5-operating-system/virtual-memory/thrashing-allocation/asset-local-vs-global-replacement after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the course: About the Course
  2. Mathematical Aptitude: Number System, HCF LCM, Divisibility Rules, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Time and Work, Mensuration and Geometry, Simple Interest and Compound Interest, Speed Time and Distance, Age Problems, Mixture and Alligation, Algebra, Powers and Exponents (Surds and Indices), Pipe and Cistern, Trigonometry, Statistics, Data Interpretation, Arithmetic, Number System & Place Value, Factors, Multiples, Divisibility, HCF & LCM, Coordinates & Graphs, Higher Mathematics — Trigonometry, Quadratics, Polynomials, Progressions, Statistics, Logarithms
  3. Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Analogy, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Seating Arrangements, Syllogisms, Venn Diagram, Puzzle Solving (Puzzles), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Analytical Reasoning (Counting Figures Reasoning), Cubes & Dices, Calendar, Clock
  4. General Knowledge: Physics, Chemistry, Biology, History, Geography, Polity, Indian Economy, GK- Current Affairs, Static General Knowledge
  5. Art of Teaching: Nature, Objectives & Characteristics of Teaching, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Classroom Management & Communication, Teaching-Learning Aids & ICT Integration, Evaluation, Assessment & Measurement, Professional Development & Ethics, Policies, Acts & Contemporary Issues, Curriculum & School Environment, Guidance, Counselling & Mental Health, Inclusive Education & Special Needs, Micro-Teaching & Teaching Skills, Lesson Planning
  6. Environmental Science: Environment
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. Unit 2 | COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  13. Unit 6 | 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, Transaction Management, Concurrency Control
  14. Unit 7 | 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
  15. Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML, Node.js
  18. Unit 11 | 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
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing, कंप्यूटर नेटवर्क / Computer Networks
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
  22. Unit 15 | Multimedia: Multimedia
  23. Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture provides a detailed explanation of page replacement algorithms in operating systems, specifically distinguishing between Local and Global replacement strategies. The instructor begins by defining Local Replacement, emphasizing that each process must select a replacement frame only from its own set of allocated frames. He uses a whiteboard to demonstrate this concept, writing "Pi = 3/4/5" to indicate a process with a specific number of allocated frames. He draws a vertical stack of memory frames, marking them with 'X', and illustrates a page fault by drawing an arrow from a circle to the top frame, showing that replacement occurs strictly within the allocated set. The lecture then transitions to Global Replacement, where the rules change significantly. The on-screen text explains that a process can now select a replacement frame from the entire set of frames, even if those frames are currently allocated to other processes. This allows a process to potentially increase its number of allocated frames. However, the instructor highlights a significant problem: a process cannot control its own page-fault rate because the set of pages in memory depends on the paging behavior of other processes as well. Despite this, the slide notes that global replacement generally results in greater system throughput and is therefore the more common method used in practice.

Chapters

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

    The instructor introduces "Local Replacement" using on-screen text stating it requires processes to select from their own set of allocated frames. He writes "Pi = 3/4/5" on the whiteboard to represent a process with a fixed allocation. He draws a vertical stack of frames marked with 'X' to visualize the memory. He draws an arrow from a circle (representing a page fault) to the top frame, clearly illustrating that replacement happens only within the allocated set, meaning the number of frames does not change. The text also notes that under local replacement, the set of pages in memory for a process is affected by the paging behavior of only that process. This ensures isolation between processes and prevents interference.

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

    The topic shifts to "Global Replacement," defined on screen as allowing a process to select a replacement frame from the set of all frames, even if that frame is currently allocated to another process. The instructor points to the text explaining that a process may increase its allocated frames by taking them from others. He discusses the downside: a process cannot control its page-fault rate because it depends on the paging behavior of other processes. The slide notes that global replacement generally results in greater system throughput and is the more commonly used method. He draws a similar vertical rectangle to represent the shared pool of frames. This method is often preferred for better overall system performance in practice.

The video contrasts two page replacement strategies. Local replacement isolates processes, keeping their frame count constant but potentially hindering them if they need more memory. Global replacement allows dynamic frame allocation across processes, improving throughput but introducing unpredictability in page-fault rates. The choice depends on system goals and performance requirements.

Loading lesson…