Operating SystemS
Course Objectives
Provide an insight into the basic organization of computer systems.
Familiarize students with various components of an Operating System
Focus on fundamental problems and optimal solutions for resource management operating systems such as process and disk scheduling and memory management
Understand different possible solutions for handling deadlock situation.
Course Outcomes
Upon successful completion of this course, students should be able to:
CO1. Identify the different components of an operating system.
CO2. Evaluate various scheduling algorithms and their performance trade-offs.
CO3. Relate algorithmic solutions for process synchronization problems and handling deadlocks.
CO4. Analyse performance issues associated with I/O devices.
CO5. Measure, evaluate, and compare OS components through instrumentation for performance analysis.
UNIT:1 (10 Hours)
Operating System Introduction: Operating Systems Objectives and functions, Computer System Architecture, OS Structure, OS Operations, Evolution of Operating Systems - Simple Batch, Multi programmed, time shared, Personal Computer, Parallel, Distributed Systems, Real-Time Systems, Special - Purpose Systems, Operating System services, user OS Interface, System Calls, Types of System Calls, System Programs, Opening System Design and Implementation, OS Structure, Virtual machines.
UNIT:2 (10 Hours)
Process and CPU Scheduling - Process concepts - The Process, Process State, Process Control Block, Threads, Process Scheduling - Scheduling Queues, Schedulers, Context Switch, Pre-emptive Scheduling, Dispatcher, Scheduling Criteria, Scheduling algorithms, Multiple-Processor Scheduling, Real-Time Scheduling, Thread scheduling, Case studies: Linux, Windows. Process Coordination - Process Synchronization, The Critical section Problem, Peterson's solution, Synchronization Hardware, Semaphores, and Classic Problems of Synchronization, Monitors, Case Studies: Linux, Windows.
UNIT:3 (10 Hours)
Memory Management and Virtual Memory - Logical & physical Address Space, Swapping, Contiguous Allocation, Paging, Structure of Page Table. Segmentation, Segmentation with Paging, Virtual Memory, Demand Paging, Performance of Demanding Paging, Page Replacement Algorithms, Allocation of Frames, Thrashing.
Deadlocks - System Model, Deadlock Characterization, Methods for Handling Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection and Recovery from Deadlock.
UNIT:4 (10 Hours)
File System Interface - The Concept of a File, Access methods, Directory Structure, File System Mounting, File Sharing, Protection, File System Implementation - File System Structure, File System Implementation, Allocation methods, Free-space Management, Directory Implementation, Efficiency and Performance. Mass Storage Structure - Overview of Mass Storage Structure, Disk Structure, Disk Scheduling, Disk Management, Swap space Management.
Protection - System Protection, Goals of Protection, Principles of Protection, Domain of Protection, Access Matrix, Implementation of Access Matrix, Access Control, Revocation of Access Rights, Capability-Based Systems, Language-Based Protection.