Thrashing

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-POLYTECHNIC-LECTURER-COMPUTER-SCIENCE/paper-2-operating-systems/virtual-memory/thrashing-allocation/asset-thrashing after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  2. Digital Logic: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Pipelining, Multiprocessors
  4. Programming: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  5. Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  6. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  7. Theory of Computation: Grammar, Regular Language Properties, Moore & Mealy Machines, Turing Machines
  8. Compiler Design: 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  9. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Security
  10. Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, ORDBMS, NoSQL
  11. 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
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a detailed explanation of 'Thrashing' within the context of operating systems. The instructor, Sanchit Jain from Knowledge Gate Educator, utilizes a presentation slide featuring a specific definition and a graphical representation to illustrate the phenomenon. The central theme revolves around the relationship between CPU utilization and the degree of multiprogramming. The slide explicitly defines thrashing as a state where a process spends more time paging than executing. The graph serves as a visual aid to demonstrate how system performance degrades when the degree of multiprogramming exceeds a certain threshold, leading to high paging activity and reduced CPU efficiency.

Chapters

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

    The session begins with the instructor introducing the concept of thrashing. The slide text is clearly visible, stating, 'A process is thrashing if it is spending more time paging than executing. High paging activity is called Thrashing.' The instructor stands beside a graph plotting 'CPU utilization' against the 'degree of multiprogramming.' He starts by explaining the initial positive correlation where increasing the number of processes improves CPU usage. To illustrate this progression, he physically draws tick marks on the x-axis of the graph, writing the numbers '1, 2, 3' sequentially. He uses hand gestures to trace the upward slope of the curve, indicating that as more processes are added, the CPU becomes busier and utilization rises.

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

    The instructor continues his explanation by extending the x-axis markings to include '4, 5, 6, 7, 8, 9'. He points specifically to the peak of the curve, identifying it as the optimal point for multiprogramming. He then shifts focus to the sharp decline in the graph that occurs after this peak. He explains that once the degree of multiprogramming goes beyond a certain limit (around 6 or 7), the system enters a state of thrashing. To emphasize this critical transition, he draws a red cross or line over the dropping section of the curve. He clarifies that in this region, the CPU utilization drops drastically because the system is overwhelmed with paging activity, spending more time moving data between memory and disk than actually executing instructions.

The lecture successfully bridges the gap between abstract definitions and practical system behavior. By combining the textual definition of thrashing with the graphical drop in CPU utilization, the instructor clarifies that simply adding more processes does not always improve performance. Instead, there is a critical threshold; exceeding it leads to thrashing, where the system becomes inefficient due to excessive paging, resulting in a significant drop in CPU utilization.

Loading lesson…