No Pre-Emption

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/MCA-ENTRANCE-EXAM/operating-system/deadlock/deadlock-prevention/asset-no-pre-emption after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Aptitude and Math: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Algebra, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Statistics, Probability, Percentage, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Average, Calculus, Trigonometry, Vectors, Linear Algebra
  2. Logical and Analytical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Verbal Analogy (Word Based Analogy), Directions (Direction Test), Blood Relations, Ranking, Order and Sequence, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Puzzle Solving (Puzzles), Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning)
  3. English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Verb, Articles, Preposition, Pronoun, Conjunction, Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Cloze Test (Cloze Passage)
  4. Computer Architecture: 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
  5. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  6. Operating System: 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
  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, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Cyber and Info Security
  8. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  9. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. DBMS: 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, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture focuses on the 'No pre-emption' condition in deadlock handling strategies within operating systems. The instructor, Sanchit Jain Sir, breaks down the specific rules governing resource allocation when pre-emption is not strictly forbidden but managed under certain conditions. He explains the step-by-step logic a system follows when a process requests resources: checking availability, checking if another waiting process holds them, and handling the waiting state. The lecture includes visual aids on the slide and hand-drawn diagrams to clarify the flow of resource pre-emption between processes.

Chapters

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

    The instructor begins by analyzing the slide titled 'No pre-emption'. He reads the first bullet point: 'if a process requests some resources, we first check whether they are available. If they are, we allocate them.' He then moves to the second point, explaining that if resources are not available, the system checks if they are allocated to another process waiting for additional resources. If this condition is met, the system pre-empts the resources from the waiting process and allocates them to the requesting process. To illustrate this, he draws a diagram on the screen with 'R' representing a resource and 'P' representing a process, showing an arrow indicating the transfer of resources from one to the other.

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

    The lecture proceeds to the third bullet point: 'If the resources are neither available nor held by a waiting process, the requesting process must wait.' The instructor emphasizes that while waiting, the process's own resources may be pre-empted if another process requests them. He then explains the final condition: a process can only be restarted when it is allocated the new resources it requested and recovers any resources that were pre-empted while it was waiting. He gestures to emphasize the recovery aspect of the process restart, ensuring the student understands that the process must regain its lost resources before continuing execution.

The video provides a detailed walkthrough of the 'No pre-emption' condition in deadlock handling. It clarifies that pre-emption is conditional. The system first checks availability. If unavailable, it looks for a waiting process holding the resource to pre-empt from. If no such process exists, the requester waits. During this wait, the requester is vulnerable to having its own resources taken by others. The process only resumes execution once it secures the requested resources and regains any previously held resources that were taken away. This structured approach ensures that resources are managed efficiently without causing indefinite blocking, balancing the needs of multiple processes in the system effectively.

Loading lesson…