OSC (Operating Systems Concepts)

Here is what you should know from the text. Much of this is covered in class; some parts you have read up on your own. (The section numbers and titles below come from the “OSC with Java, 6th edition”. Other editions (including other 6th editions) have the same material, usually with the same section titles but perhaps different section/chapter numbers.)

• Chapter 1 Introduction.
  Casual overview adequate.
• Chapter 2 Computer-System Structures.
  Casual overview adequate.
• Chapter 3 Operating-System Structures.
  Casual overview adequate (can skip section 3.7 Java).
• Chapter 4 Processes.
  4.1 Process concept; 4.2 Process scheduling; 4.3 Operations on processes; 4.4 Cooperating processes; 4.5 Interprocess Communication
• Chapter 5 Threads:
  5.1 Threads overview; 5.2 Multithreading models; 5.3 Threading issues; 5.4 Pthreads.
• Chapter CPU Scheduling:
  6.1 Basic concepts; 6.2 Scheduling criteria; 6.3 Scheduling algorithms; 6.4 Multiple-Processor Scheduling; 6.6 Thread Scheduling
• Chapter 7 Process Synchronization:
  7.1 Background; 7.2 The Critical Section Problem; 7.4 Synchronization hardware; 7.5 Semaphores; 7.6 Classical synchronization problems; 7.7 Monitors (SKIP FOR NOW).
• Chapter 9 Memory Management:
  9.1 Background; 9.2 Swapping; 9.3 Contiguous-Memory Allocation; 9.4 Paging (skip: 9.4.4.2 Hashed Page Tables; 9.4.4.3 Inverted Page Tables) ; 9.5 Segmentation; 9.6 Segmentation with Paging.
• Chapter 10 Virtual Memory:
  10.1 Background; 10.2 Demand Paging; 10.3 Copy-on-Write; 10.4 Page Replacement; 10.5 Allocation of Frames; 10.6 Thrashing; 10.8 Other Considerations.
• Chapter 11 File-System Interface:
  11.1 File Concept; 11.2 Access Methods; 11.3 Directory Structure; 11.4 File-System Mounting; 11.5 File Sharing; 11.6 Protection.
• Chapter 12 File-System Implementation:
  12.1 File-System Structure; 12.2 File-System Implementation; 12.3 Directory Implementation; 12.4 Allocation Methods; 12.5 Free-Space Management; 12.6 Efficiency and Performance; 12.7 Recovery; 12.8 Log-Structured File System; 12.9 NFS.
• Chapter 8 Deadlocks:
  8.1 System Model; 8.2 Deadlock Characterization; 8.3 Methods for Handling Deadlocks; 8.4 Deadlock Prevention; 8.5 Deadlock Avoidance; 8.6 Deadlock Detection; 8.7 Recovery from Deadlock; 8.8 Summary;

Notes

• Class notes on multi-threaded programs (Updated Nov 9 2012)
• Class notes on filesystems (Dec 5 2012)
• Note 2: Toy OS
• Note 3: Toy OS with Asynchronous IO
• Note 4: Basic Concepts about Concurrent Processes
• Note 5: N-Process Mutual Exclusion Problem
• Note 6: Peterson's Solution for 2-Process Mutual Exclusion
• Note 9: Semaphores
• Note 8: Low-level read-modify-write atomicty
• Note 11: No Busy Waiting
• Note 7: Bakery Algorithm

GeekOS stuff

• GeekOS overview.
• Project 0
• Project 1
• Project 2
• Project 3
• Project 4
• Project 5