CS134a

Computing Systems, 2000

Instructor: Jason Hickey
TAs: Marion Vance, Xin Yu

Caltech Computer Science Department

• Overview and administration
• Q&A post

Lectures

1. Sept 25: Introduction
2. Sept 27: Architecture
3. Processes (Part I: constructs and synchronization) [handouts]
   • Sept 29: Processes and synchronization [handouts]
   • Oct 2: Semaphores, bounded-buffer [handouts]
   • Oct 4: CRC, monitors, readers/writers [handouts]
   • Oct 6: Deadlock, Dining Philosophers [handouts]
4. Processes (Part II: scheduling) [handouts]
   • Oct 9: Process and resource control [handouts]
   • Oct 11: Scheduling [handouts]
   • Oct 13: Scheduling [handouts]
5. Memory Management [handouts]
   • Oct 16: Relocation [handouts]
   • Oct 18, 20: Virtual Memory [handouts]
   • Oct 27: Replacement Policies [handouts]
   • Oct 30: Shared libraries [handouts]
6. Filesystems and IO
   • Filesystems [handouts]
7. Protection and security
   • Nov 8: General issues [handouts]
8. Modern Operating Systems
   • Nov 17: Mach and Amoeba [handouts]
   • Nov 20: ExoKernel [handouts]
   • Nov 27: VINO [handouts]
   • Nov 29: Spin [handouts]

Homeworks

1. Sept 29: Processes and synchronization [solution]
2. Oct 9: Monitors and deadlock [solution]
3. Oct 13: Scheduling [solution]
4. Oct 30: Virtual Memory [solution]
5. Nov 6: Virtual Memory and Filesystems [solution]
6. Nov 13: Filesystems [solution]
7. Nov 20: Security
8. Nov 27: SFI [solution]

Exams

1. Oct 25: Midterm [solution]
2. Dec 11: Final [solution]

Labs

1. Oct 13: Implementing process synchronization using system calls [solution]
   • Part I: adding a system call
   • Part II: defining semaphores
   • Test programs: time_test.c, sem_test.c
2. Nov 1: Kernel modules and scheduling [solution]
   • Test files: Makefile, cs134time.c, time_test.c,
3. Nov 20: FAT filesystem [solution]
   • Test files: Makefile, msdos.c, floppy.img