Principles of Operating Systems

Contents

1. Processes Scheduling and Multithreaded Programming
1. Introduction
1.1 What is a Process?
1.2 Process State
1.3 Process Control Block (PCB)
2. Process Scheduling
2.1 Scheduling Queue
2.2 Queuing Diagram Representation of Process Scheduling
2.3 Types of Schedulers
2.4 Working of Schedulers
2.5 Context Switch
3. Operations on Processes
3.1 Process Creation
4. Interprocess Communications
4.1 Shared Memory System
4.2 Message Passing System
5. Multithreaded Programming
5.1 Types of Threads
5.2 Multithreading Models
6. Basic Concepts
6.1 CPU- I/O Burst Cycle
6.2 CPU Scheduler
6.3 Scheduling Types
6.4 Dispatcher
7. Scheduling Criteria
8. Scheduling Algorithms
8.1 First Come First Served (FCFS)
8.2 Shortest Job First Scheduling (SJF)
8.3 Priority Scheduling
8.4 Round Robin Scheduling (RR)
8.5 Multilevel Queue Scheduling
8.6 Multilevel Feedback Queue Scheduling
9. Thread Scheduling
9.1 Thread Libraries
2. Processes Synchronization
1. Introduction
2. Background
3. Critical Section Problem
4. Semaphores
4.1 Usage
4.2 Implementation
5. Classic Problem of Synchronization
5.1 Producer Consumer Problem (Bounded Buffer Problem)
5.2 A Reader-Writer Problem
5.3 Dining – Philosophers Problem
3. Deadlocks
1. Introduction
2. System Model
3. Deadlock Characterization
3.1 Necessary Conditions
3.2 Resource Allocation Graph
4. Deadlock Prevention
5. Deadlock Avoidance
5.1 Safe State
5.2 Resource Allocation Graph Algorithm
5.3 Banker’s Algorithm
6. Deadlock Detection
6.1 Single Instance of Each Resource Type
6.2 Several Instances of Each Resource Type
6.3 Usage of Detection Algorithm
7. Recovery from Deadlock
7.1 Process Termination
7.2 Resource Pre-emption
4. Memory Management
1. Introduction
2. Background
2.1 Basic Hardware
2.2 Address Binding
2.3 Logical Versus Physical Address Space
2.4 Dynamic Loading
2.5 Dynamic Linking and Shared Libraries
3. Swapping
4. Contiguous Memory Allocation
4.1 Memory Mapping and Protection
4.2 Memory Allocation
4.3 Fragmentation
5. Paging
5.1 Basic Method
5.2 Hardware Support
5.3 Protection
5.4 Shared Pages
6. Segmentation
6.1 Basic Concept
6.2 Hardware
7. Virtual Memory Management
7.1 Virtual Memory
7.2 Demand Paging
7.3 Performance of Demand Paging
7.4 Page Replacement
7.5 Evaluation of Page Replacement Algorithm
8. Thrashing
8.1 Cause of Thrashing
8.2 Working-Set Model
5. File System
1. Introduction
2. File Concept
2.1 File Attributes
2.2 File Operations
2.3 File Types
2.4 File Structure
2.5 Internal File Structure
3. Access Methods
3.1 Sequentia
3.2 Direct Access
3.3 Other Access Methods
4. Directory and Disk Structure
4.1 Storage Structure
4.2 Directory Overview
4.3 Tree Structure Directory
4.4 Acyclic Graph Directory
4.5 General Graph Directory
5. File System Structure as Implementation
5.1 File System Structure
5.2 File System Implementation
5.3 Partitions and Mounting
5.4 Virtual File Systems
6. Allocation Methods
7. Free Space Management
7.1 Bit Vector
7.2 Linked List
7.3 Grouping
7.4 Counting
7.5 Space Maps
6. Disk Scheduling
1. Overview
1.1 Disk Performance Parameters
2. Disk Structure
3. Disk Scheduling
3.1 Scheduling Algorithms
4. Disk Management
4.1 Disk Formatting
4.2 Boot Block
4.3 Bad Blocks