This course is an introduction to operating systems structures and design. The class will be implementa­ tion intensive. Four programming projects will be implemented. Process management, CPU scheduling and synchronization, deadlock avoidance, and memory management will be studied, along with design decision making. Windows NT case studies will be discussed and implemented.

Contents

• Process Concept and Management
  • What is a Process?
  • Process Management
  • Process States
  • Process Control Block (PCB)
• CPU Shceduling
  • Scheduling Mechanisms
  • Goals for Scheduling
  • Context Switching
    • Context of a Process
    • Context Switch Routine
  • Non-Preemptive vs Preemptive Scheduling
  • Scheduling Algorithms
    • First In First Out (FIFO)
    • Round Robin
      • Choosing Time Slice
    • Priority Based
    • Shortest Job First (SJF)
    • Multi-Level Feedback Queues
  • CPU Scheduling Programming Assignment
    • Problem statement & Discussion
    • Source Code
    • Results Analysis
    • PowerPoint Presentation
• Process Synchronization and Coordination
  • Race Conditions
  • Synchronization
  • Mutual Exclusion
  • Critical Section
    • Solutions for Critical Section
    • Disabling Interrupts
    • Lock Variables
  • Semaphores
    • Example of Sephamore Usage
• Deadlocks and Deadlock Avoidance
  • Deadlock definition
  • Conditions for Deadlock
  • Strategies for Dealing with Deadlock
  • Deadlock Prevention
  • Deadlock Avoidance
    • Safe State
    • Baker's Algorithm
    • How do you know if it is a safe state
  • Detection and Recovery
    • Recovery
  • Deadlock Detection & Avoidance Programming Assignment
    • Problem statement & Discussion
    • Source Code
    • Results Analysis
    • PowerPoint Presentation
• Memory Management
  • Basic requirements that drive memory designs
  • Memory Manager
  • Memory Management Algorithms
    • Best Fit
    • Worst Fit
    • First Fit
    • Next Fit
  • Compaction
  • Virtual Memory
  • Virtual Addressing
  • Managing Virtual Memory
    • Swapping
    • Paging
      • Steps performed by Memory Management Unit(MMU)
      • Page Table
      • Paging Issues
        • Page Tables are Large
        • Mapping must be fast
  • Memory Management Programming Assignment
    • Problem statement & Discussion
    • Source Code
    • Results Analysis
    • Memory Manager Power PointPresentation
    • Disk Manager PowerPoint Presentation
  
  
  
• Parametric Optimization of Some Critical Operating System Functions