SYSTEM SOFTWARE
EECS 111, Course Code: 18050
Quarter: Spring Quarter 2010


Home | Syllabus | Assignments | Schedule | Message Board | Resources

Detailed Class Schedule

(last update: June 3, 2010)

Week Tuesday Thursday
1
Mar 30
Lecture 1, Chapter 1: Introduction
  • Course administration, set up
  • Operating system introduction, overview
  • Input/output methods, polling, interrupts
Apr 1
Lecture 2, Chapter 1, Chapter 2: Introduction
  • Operating system structure, operation
  • I/O, direct memory access
  • Management of storage, memory, processes
2
Apr 6
Lecture 3, Chapter 2: Operating System Structure
  • System calls, system programs
  • OS structure, design, implementation
Apr 8
Lecture 4, Chapter 3: Processes
  • Process concept
  • Process scheduling
  • Process creation, termination
3
Apr 13
Lecture 5, Chapter 3: Processes
  • Inter-process communication
  • Shared memory
  • Message passing, remote procedure calls
Apr 15
Lecture 6, Chapter 4: Threads
  • Multi-threading concept, models
  • Thread libraries
  • Threading issues
4
Apr 20
Lecture 7, Chapter 5: CPU Scheduling
  • Scheduling concepts
  • Scheduling criteria
  • Scheduling algorithms
Apr 22
Lecture 8, Chapter 5: CPU Scheduling
  • Scheduling algorithms
  • Thread and multi-processor scheduling
  • Algorithm evaluation
5
Apr 27
Lecture 9, Chapter 6: Process Synchronization
  • Producer consumer problem
  • Critical section problem
  • Synchronization primitives
Apr 29
Lecture 10, Chapter 6: Process Synchronization
  • Synchronization primitives
  • Semaphores
  • Classic synchronization problems
6
May 4
Lecture 11, Chapter 6: Process Synchronization
  • Monitors
  • Condition variables
  • Synchronization examples
May 6
Midterm Exam: Chapter 1 through 6
  • Operating system structures
  • Processes, threads
  • CPU scheduling, process synchronization
7
May 11
Lecture 12: Course Review
  • Midterm exam results
  • Assignment 4
May 13
Lecture 13, Chapter 7: Deadlocks
  • Deadlock problem and characterization
  • Deadlock prevention and avoidance
8
May 18
Lecture 14, Chapter 7, Chapter 8: Deadlocks, Memory Management
  • Deadlock detection and recovery
  • Main memory management, swapping
  • Contiguous memory allocation
May 20
Lecture 15, Chapter 8: Memory Management
  • Paging
  • Structure of page table
9
May 25
Lecture 16, Chapter 8, Chapter 9: Memory Management
  • Segmentation
  • Virtual memory
  • Demand paging
May 27
Lecture 17, Chapter 9: Memory Management
  • Page replacement
  • Allocation of frames
  • Thrashing
10
Jun 1
Lecture 18, Chapter 10: File System Interface
  • File and directory concepts
  • Access methods
  • Sharing and protection
Jun 3
Lecture 19, Chapter 11: File System Implementation
  • File system structure
  • Allocation methods
  • Free space management
Final
Jun 10
Final Exam:
4:00 - 6:00pm

The Electronic Educational Environment
University of California, Irvine
http://eee.uci.edu/10s/18050/