Working Set Strategy

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/ASRB-ICAR-T3-T4-INFORMATION-TECHNOLOGY-PRELIMS-MAINS/operating-system/virtual-memory/thrashing-allocation/asset-working-set-strategy after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Prelims: General Knowledge: Physics Chemistry Biology History Geography Polity Indian Economy Static General Knowledge GK- Current Affairs Environment
  2. Prelims: General English: Vocabulary Noun Pronoun Adjectives Preposition Articles Direct and Indirect Speech Tenses Conjunction Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Sentence Correction (Error Correction) Sentence Completion (Fill in the blanks) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Cloze Test (Cloze Passage) Verbal Analogy (Word Based Analogy) Sentence Construction Adverb Verb
  3. Prelims: Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) HCF LCM Divisibility Rules Average Sequence and Series (Series) Number System Powers and Exponents (Surds and Indices) Algebra Profit and Loss Simple Interest and Compound Interest Time and Work Pipe and Cistern Speed Time and Distance Mixture and Alligation Mensuration and Geometry Age Problems Partnership Statistics Data Interpretation Arithmetic
  4. Prelims: General Agriculture: Agriculture in India and Tripura Natural Resource Management Fundamentals of Crop Production Horticulture Crop Improvement Crop Protection Social Science
  5. IT Mains: Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management Distributed Systems
  6. IT Mains: Computer Networking: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control 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
  7. IT Mains: DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery Big Data Systems Database Security & Authorization Enhanced Data Models NoSQL
  8. IT Mains: Software Engineering: Fundamentals of Software Engineering Software Requirements and Quality Assurance Software Design, Estimation and Metrics Software Testing Software Maintenance and Configuration Management
  9. IT Mains: Data Structures & Algorithms: Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing Algorithm Analysis Time Complexity Analysis Sorting Algorithms
  10. IT Mains: OOPS with C++ & Java: C Fundamentals OOPS with C++ Java Fundamentals Array, String, IO & References OOPS with Java Generic & Collections Multithreading File Handling & I/O
  11. IT Mains: Python: Introduction to Python Tokens, Variables, Data Types, I/O Operators & Expressions Control Flow & Looping Collections & Strings Functions & Modules
  12. IT Mains: Website Development: Website, Browser & Services Internet Fundamentals Web Design & Development Protocols & Services Web Publishing & Hosting Server Side & Security Emerging Technologies HTML Basics HTML5 CSS JavaScript-Basics .Net Programming PHP
  13. IT Mains: Mobile App Development: Mobile Computing Multimedia
  14. IT Mains: Linux / Windows Server Admin: Unix OS Linux OS
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture introduces the Working Set Strategy in operating systems, focusing on the locality model of process execution. The instructor explains that a program moves through different localities, where a locality is defined as a set of pages actively used together. Using a page reference table, he demonstrates how to calculate the working set at specific time points ($t_1$ and $t_2$) by analyzing the pages referenced within a fixed window size ($\Delta$). The lesson highlights the dynamic nature of memory requirements as a process transitions between different localities.

Chapters

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

    The video begins with a slide titled 'The Working Set Strategy'. The instructor reads the first bullet point: 'This approach defines the locality model of process execution.' He then explains the second point, stating that as a process executes, it moves from locality to locality. He defines a locality as 'a set of pages that are actively used together.' He points to the third bullet point, noting that a program is generally composed of several different localities which may overlap. He gestures towards the 'page reference table' at the bottom of the slide, which lists a sequence of numbers like 2, 6, 1, 5, 7, 7, 7, 7, 5, 1, 6, 2, 3, 4, 1, 2, 3, 4, 4, 4, 3, 4, 3, 4, 4, 4, 1, 3, 2, 3, 4, 4, 4, 3, 4, 4, 4.

  2. 2:00 – 5:00 02:00-05:00

    The instructor focuses on the diagram below the table, which shows time points $t_1$ and $t_2$ with a window size $\Delta$. He explains that the working set at time $t$, denoted as $WS(t)$, consists of the pages referenced in the interval $[t - \Delta, t]$. He draws a box around the sequence ending at $t_1$, which includes the numbers 2, 6, 1, 5, 7, 7, 7, 7, 5, 1. He identifies the unique pages in this window as {1, 2, 5, 6, 7}. He writes $WS(t_1) = \{1, 2, 5, 6, 7\}$ and counts the number of unique pages, writing a '5' below it to represent the working set size. He then moves to $t_2$, drawing a box around the sequence ending there, which includes 3, 4, 4, 4, 3, 4, 3, 4, 4, 4, 1. He identifies the unique pages as {3, 4}. He writes $WS(t_2) = \{3, 4\}$ and counts the unique pages, writing a '2' below it.

  3. 5:00 – 5:40 05:00-05:40

    The instructor concludes the example by comparing the two working sets. He points to the numbers 3 and 4 in the reference table, emphasizing that these are the pages currently being used at time $t_2$. He explains that the working set size has decreased from 5 to 2, indicating a shift in the process's locality. He reiterates that the working set strategy helps in determining the number of frames a process needs in memory to avoid thrashing. He gestures back and forth between the two time points to show the transition from one locality to another.

The lesson progresses from theoretical definition to practical application. It starts with the definition of locality and the working set strategy, then moves to a concrete example using a page reference string. The instructor demonstrates how to calculate the working set size at different time points by analyzing the recent history of page accesses within a fixed window $\Delta$. This illustrates the dynamic nature of memory requirements for a process.

Loading lesson…