CS422S: Operating Systems Organization (Fall 1998)

Department of Computer Science
School of Engineering and Applied Science
Washington University in St. Louis
Meeting time: M/W 2:30 - 4:00, Cupples II 217

Instructor

Dr. Ken Wong
kenw@arl.wustl.edu
Office Hours: By appointment, Bryan 508

Graders

Pengfei Lei , lei@cs.wustl.edu
Office Hours: Tue 4-6pm (Jolley 513) or by appointment through e-mail.
Sanjin Loncaric , sl17@cec.wustl.edu
Office Hours: Mon 4-6pm (Lopata 406) or by appointment through e-mail for Wed before 230pm, Fri after 1pm, or weekends.

Quick Links


Note : The remainder of this page is based on a Web page done by Dr. Eileen Kraemer. Thanks, Eileen!



Course Description

Exploration of operatings systems as resource managers. Using UNIX as a conceptual framework, students study algorithms and data structures that support essential operating systems services. Concepts are reinforced through programming exercises and comparative studies. Topics include: process scheduling, file systems organization, memory management, virtual memory, device management, concurrent processes, and security.

Prerequisites


Texts

Required: Also Useful:

Grading

The relative weighting of the components of the grades is:

Exams

There will be two exams: a mid-term and a final. Each exam will be worth 20% of your grade. Material tested on the final exam will be comprehensive.

Programming Projects

There will be 3-4 programming projects. Projects will involve substantial programming and students are assumed to be competent in C or C++ and familiar with the UNIX operating system.

The criteria for the grading of the programs and the penalty for late submissions will be elaborated at the time that each project is assigned.

Homework, Quizzes, and Class Attendance

There will be one homework associated with each programming assignment, and approximately 4-6 short graded quizzes. The bottom 25% quiz scores will be dropped from your final grade. Quizzes will be based on material presented in class. There will be oth announced and unannounced quizzes. Therefore, it is essential that you attend class in order to prepare for the quizzes and exams. There will be no makeup quizzes.

Late Submissions

Late submissions of program and homework solutions are NOT allowed unless stated explicitly in the assignment description or announced by me (either by email or in class). Occassionally, in special situations, arrangements for a late submission can be made if it is made in advance.

Tentative Syllabus (Subject to Change)

Date Class # Topic Text Chapter
8/26 1
Introduction, Overview of OS
1
8/31 2 Computer System Structures 2
9/7 3 Operating System Structures 3
9/9 4 Processes 4
9/14 5 Interprocess Communication 4
9/16 6 Threads 4
9/21 7 CPU Scheduling Algorithms 5
9/23 8 More about Scheduling Algorithms 5
9/28 9 Synchronization 6
9/30 10 Classical Problems and Monitors 6
10/5 11 Deadlocks 7
10/7 12 Deadlock detection and recovery 7
10/12 13 Catchup 8
10/14 14 Memory Management 8
10/19 15 Memory Management 8
10/21 16 Paging and Segmentation 8
10/26 17 Midterm Review
10/28 18 Midterm Exam - Chapters 1 - 8
11/2 19 Virtual Memory 9
11/4 20 File System Interface 10
11/9 21 File System Implementation 11
11/11 22 Secondary Storage Structures 12
11/16 23 Protection and Security 13, 14
11/18 24 Networks 15
11/23 25 Distributed System Structures 16
11/25 no class Thanksgiving
11/30 26 Distributed File Systems 17
12/2 27 Distributed Coordination 18
12/7 28 Distributed Coordination 18
12/9 30 Review
12/XXX
Final Exam, X:XX - X:XX


Programming Assignments


Online Notes and Tutorials

Warning : Some links may not work.


Last modified 23 Aug. 1998 - Please send corrections to kenw@arl.wustl.edu