Working Set Strategy

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/NIACL-AO-IT-SPECIALIST/operating-system-it-specialist/virtual-memory/thrashing-allocation/asset-working-set-strategy after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Speed Mathematics and Basic Mathematics, Algebra, Percentage, Profit and Loss, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Partnership
  2. Reasoning Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Seating Arrangements, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Syllogisms, Blood Relations, Puzzle Solving (Puzzles), Inequality, Machine Input-Output
  3. English Language: Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, 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), Sentence Construction, Pronoun, Preposition, Conjunction, Adverb, Verb, Modals, Articles, Determiner, Interjection
  4. General Awareness: Evolution of Indian Banking (Banking & Financial Awareness), GK- Current Affairs, Static General Knowledge, Indian Economy
  5. C Concepts + MCQs (IT Specialist): C Programming by Yash Sir, C Language Core
  6. Java (IT Specialist): Java
  7. Python (IT Specialist): Python for Placements by Yash Sir, Python Basics
  8. OOPs (IT Specialist): Object Oriented Programming (OOPS)
  9. DBMS (IT Specialist): 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
  10. SQL (IT Specialist): SQL
  11. Software Engineering (IT Specialist): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Data Structure (IT Specialist): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  13. Operating System (IT Specialist): 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
  14. Compiler Design (IT Specialist): Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  15. Computer Architecture (IT Specialist): 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
  16. Data Communication & Networking (IT Specialist): 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
  17. Descriptive Test (Main Exam): English Writing Ability
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…