Page 115 - DCAP103_Principle of operating system
P. 115
Principles of Operating Systems Manpreet Kaur, Lovely Professional University
Notes Unit 4: Process Management-III
CONTENTS
Objectives
Introduction
4.1 Concept of Critical Section
4.1.1 Basic Concept
4.2 The Critical Section Problem
4.3 Way to Handle Critical Section Problem
4.4 Safety-Critical Operating Systems
4.4.1 Terminology
4.4.2 Memory Protection
4.4.3 Fault Tolerance and High Availability
4.4.4 Mandatory vs. Discretionary Access Control
4.4.5 Guaranteed Resource Availability: Space Domain
4.4.6 Guaranteed Resource Availability: Time Domain
4.4.7 Schedulability
4.4.8 Interrupt Latency
4.4.9 Bounded Execution Times
4.4.10 Priority Inversion
4.4.11 Changing Requirements
4.5 Semaphores
4.5.1 Producer-Consumer Problem Using Semaphores
4.6 Deadlock Concept and Handling
4.6.1 System Model
4.6.2 Deadlock Characterization
4.6.3 Resource-Allocation Graph
4.6.4 Methods for Handling Deadlocks
4.6.5 Deadlock Prevention
4.6.6 Deadlock Avoidance
4.6.7 Mutual Exclusion
4.6.8 Hold and Wait
4.6.9 No Preemption
4.6.10 Circular Wait
4.6.11 Safe State
4.6.12 Resource-Allocation Graph Algorithm
4.6.13 Banker’s Algorithm
4.6.14 Resource-Request Algorithm
4.6.15 Deadlock Detection
4.6.16 Single Instance of Each Resource Type
108 LOVELY PROFESSIONAL UNIVERSITY