Disclaimer:

This is a set of notes, that summarizes the class coverage of material. By no means is this comprehensive or is a substitute for class notes an attendance. Also, updating of this page is not guaranteed to be frequent.

Class 1: Sept 14^th.

• Administrative
• Prerequisites
• Unix accounts
• Course Structure – lectures, homework’s, projects/exams
• Conceptual Course – Policies over Mechanisms
• What is an operating system
• Low level software
• Environment, government, resource allocator
• Convenience of the user, efficient operation.
• Old operating systems – manual, to resident monitor to offline operations, to spooling to buffering.

Class 2: Sept 21st:

• Spooling/Buffering/Caching (recap)
• Time sharing
• Parallel and Distributed Processing
• Real Time Systems
• Course Outline:
  • History.
  • Processes.
  • Scheduling.
  • Concurrency.
  • Memory,
  • devices,
  • deadlocks,
  • files
• Organization: Interrupts, I/O, memory, storage,
• Protection - memory bounds and processor modes
• System Calls and how they are implemented
• READING ASSIGNEMENT: Chapters 1-3, including material on OS structure, OS services.

Class 3: Sept 28th:

Recap – Protection. OS Structure, OS Services. 

PROCESSES

• Concept of a process
• Programs and Processes
• Processes and Memory
• Threads as a special case of a process
• States of a process
• PCB’s and Context Switching
• Scheduling and Scheduling Queues
• Schedulers
• Creation/termination of processes
• Inter Process Communication
• Exceptions

Class 4: Oct 5th:

CPU Scheduling

• CPU and I/O bursts
• What is scheduling?
• The types of schedulers
• How is a process scheduled
• Metrics of Scheduling – CPU Utilization, Throughput, Turnaround time, Waiting time. Response time.
• Non Preemptive Schedulers
• FCFS, SJF, Priority
• Preemptive Schedulers
• RR, MLQ, MLFQ
• Multiprocessor Scheduling. Real Time Scheduling
• Evaluation of Schedulers – analytical (deterministic, queuing, simulations), implementations

Class 5: Oct 12th

CONCURRENT PROCESSES

• Introduction to concurrency
• Why is concurrency important to OS
• What are the ramifications of concurrent executions (sample progrmas)
• Race conditions – definition
• Mutual exclusion – definition and need for definitions
• The software solutions to the 2-process mutual exclusion problems
• Peterson’s Solutions
• Multiple processes – Lamport’s bakery Algorithms
• Hardware Solutions

Class 6: Oct 19th

• Introduction to Semaphores
• How to use semaphores
• Bounded Buffer Problem
• Readers and Writers Problem
• Implementing Semaphores (on uni- and multi- processor systems)
• Starvation Free Readers and Writers

Class 7: Oct 26th

• Project description
• Project Demo
• Starvation Free Readers and Writers
• PROJECT 1 and Project Resources are here

Class 8: Nov 2

• Exam

Class 9: Nov 9

• Dining Philosophers using Semaphores
• Conditional Critical Regions (bounded buffer and readers and writers)

Class 10: Nov 16

• Dining Philosophers using CCR's
• Equivalence of CCR and Semaphores (uncludes implementation of CCRs using Seamphores)
• Monitors
• Bounded buffer and Redears and writers using Monitors
• Reading assignment
  • Dining Philosophers using Monitors
  • Implementing Monitors using Semaphores (also equivalence of Semaphores and Monitors)

Class 11: Nov 23

• Project 2 assigned
• Memory Management
• Magic of memory management
• Address binding – compile, load run (static and dynamic relocation)
• DLL, Overlays
• Logical vs. physical memory address space
• Swapping
• Contiguous allocation – fixed, variable, fragmentation – best fit, first fit, worst fit
• Paging
• Page tables and hardware support and cache memories

Class 12: Nov 30

• Sample/practice problems assigned
• Paging and demand paging
  • Valid bit - page faulting
  • Page replacement policies (FIFO, LRU, LRU approximations)
  • Thrashing, working sets, program strcture
• Deadlocks
  • Necessary and sufficient conditions
  • Modelling using RAG and WFG
  • Preventing deadlocks (4 techniques)

Class 13: Dec 7

• Deadlocks cont'd
  • Deadlock avoidance - Bankers Algorithm
  • Deadlock detection and resolution
• Peripherals and File Systems
  • Device drivers
  • Disk head scheduling
  • Disk allocations
  • File Systems - structure, and features
• Wrap up

Class 14: Dec 14

• Final Exam
  (Exam includes all material from CPU Scheduling onwards. Thus it includes scheduling, concurrency, memory, deadlock, and peripherals)