Advanced Operating Systems (V-U)

• Course Objectives, Introduction, Issues involved in the Design of Operating Systems (V-U)
• Major Components, Structure and Internal Architecture of an OS, Monolithic VS Micro-kernel (V-U)
• Linking and Loading Anatomy of a Process; Static, Dynamic and Shared libraries (V-U)
• Processes: Definition, Address Space; Context Switching, Process Management Models (V-U)
• Process Management Models, State Machines, PCB, System Calls for Process Management (V-U)
• fork() Examples, Zombies, Wait and Waitpid System Calls, Concurrency, Threads (V-U)
• Threads: Design Space, Address Space, User and Kernel Level Threads (V-U)
• POSIX Threads: Interface, e.g clone() System Call, Process / Threads States, FSM in Linux (V-U)
• Shared Variables, Concurrency and Synchronization, Critical Sections (V-U)
• Concurrency Examples, Locks, Implementing Locks, Semaphores (V-U)
• Producer Consumer Problem, Semaphores, Condition Variables and Monitors (V-U)
• Readers / Writers Problem, Thread Safety and Reentrant Functions, Solving Thread Un-safety (V-U)
• Deadlocks: Definition, Required Conditions, Examples, Detection, Avoidance, Prevention (V-U)
• Thread Usage Paradigms, Paper by Hauser et al., Pros and Cons of Different Paradigms (V-U)
• Scheduling: Round Robin, Priority Scheduling, STCF (V-U)
• Multilevel Queue, Scheduling in: Unix, Linux; Multiprocessor Systems (V-U)
• Assignment and Scheduling of Processes / Threads to Processors, Real-time Systems (V-U)
• Real-time Operating Systems (V-U)
• Goals of a good Allocator, Memory Fragmentation, Implementation Issues of Memory Allocator (V-U)
• Explicit Free Lists Base Allocator, Segregated Free Lists, Exploiting Allocation Patterns (V-U)
• Overview of 1 - 21 Lectures (V-U)
• Goals of OS Memory Management, Multiprogramming, Virtual Addresses, Fixed & Variable Part (V-U)
• Paging, Address Translation, Page Tables & Page Table Entries, Multi-level Address Translation (V-U)
• Segmentation, Combined Segmentation & Paging, Efficient Translation and Caching (V-U)
• Set Associative & Fully Associative Cache, Demand Paging, Page Replacement Algorithms (V-U)