CSC 539: Operating Systems Structure and Design
Spring 2005


3:30 - 4:45 MW
411 Old Gymnasium
Dr. David Reed
207 Old Gymnasium      x2583
DaveReed@creighton.edu



Text: Operating Systems Concepts (7th ed.)   Silberschatz, Galvin & Gagne, John Wiley & Sons, Inc, 2004.


Course Description

This course will provide an introduction to operating system design and implementation. An operating system is a collection of software that connects users and the physical hardware of the computer. Form the user's perspective, an operating system serves as an interface, making it easier to run applications software and interact with the computer. From a systm perspective, the operating system is a resource allocator, managing shared resources (e.g., disks, networks, processors), providing common services needed by many different programs (e.g., file service, process control, printer access), and protecting individual programs from one another.

The course will begin with a brief history of operating systems over the last fifty years, and then cover the major components of most operating systems. Readings and discussions will focus on the tradeoffs that can be made between performance and functionality during the design and implementation of an operating system. Particular emphasis will be given to three major OS subsystems: process management (processes, threads, CPU scheduling, synchronization, and deadlock), memory management (segmentation, paging, swapping), and file systems. Examples will be drawn from real-world operating systems (e.g., Unix/Linux, Windows, DOS, Mac-OS) as appropriate.

Specific goals for the course include:


Required Work

There will be approximately six homework assignments, some of which will involve programming. Assignments are due at the beginning of class on the date specified. Late assignments will receive 75% of full credit if they are handed in within one week of the specified due date. After one week, no credit will be given. In addition, there will be weekly quizzes, two 75-minute tests, and a cumulative final exam.

There is no specific attendance policy for the course, although it is expected that absences will leave the student unprepared for tests and assignments. Quizzes and tests will not be rescheduled except in extreme circumstances. However, the lowest quiz grade will be dropped.

Grades will be determined as follows:

homework assignments 40 %
weekly quizzes 05 %
two 75-minute tests 30 %
(cumulative) final exam 25 %

At the minimum, traditional grading cutoffs will apply. That is, 90% is guaranteed an A, 87% is guaranteed a B+, etc. Depending on class performance, some shifting of grades (in an upward direction only) may occur as final letter grades are assigned.


Policy on Collaboration

The college policy on cheating and plagiarism is spelled out in the Student Handbook. In addition to this, the following guidelines hold pertaining to programs. Programs are to be the sole work of the student -- collaboration on the design or coding of a program is not allowed. Questions regarding homework assignments should be directed at the instructor only. Students may seek debugging assistance or clarifications on assignments via the class mailing list (accessible via Blackboard). Repeat: All student interactions regarding homework assignments must take place via email to the entire class!

Violations of this policy will be dealt with severely, with possible outcomes including failure in the course. In the case of programming assignments, you are encouraged to start early so that there is time to seek help from the instructor as the need arises.


Tentative Schedule

DATES
TOPICS
READINGS
HOMEWORK
Jan 12
Introduction, overview. (ppt)
(pdf)
Chapter 1
17
19
Computer operation, interrupts,
   OS structures, system calls.
(ppt)
(pdf)
Chapter 2
24
26
Processes, PCB, scheduling,
   cooperation, threads.
(ppt)
(pdf)
Chapters 3 & 4  
HW1: due 2/7
31
Feb 2
CPU scheduling,
   preemptive vs. nonpreemptive,
(ppt)
(pdf)
Chapter 5
7
9
   scheduling algorithms, criteria.
Process synchronization,
(ppt)
(pdf)
Chapters 5 & 6  
HW2: due 2/17
14
16
   critical section, semaphores,
   monitors.
Chapter 6
21
23
TEST 1
NO CLASS
28
Mar 2
Deadlock, prevention,
   avoidance, recovery.
(ppt)
(pdf)
Chapter 7  
HW3: due 3/16
7
9
SPRING BREAK
14
16
Memory management, swapping,
   paging, segmentation.
(ppt)
(pdf)
Chapter 8
21
23
Virtual memory, demand paging,
   replacement schemes, thrashing.
(ppt)
(pdf)
Chapter 9
28
30
NO CLASS
File systems, allocation schemes,
(ppt)
(pdf)
Chapter 10
Apr 4
6
   performance, Windows XP.
TEST 2
Chapter 11 HW4: Due 4/13
 
11
13
I/O systems, protection & security,
   disk scheduling, malware.
(ppt)
(pdf)
Chapters 12-15
18
20
Distributed systems, remote access,
   caching, coordination.
(ppt)
(pdf)
Chapters 16-18
HW5: Due 4/27
 
25
27
Case studies.
Course review
(ppt)
(pdf)
Chapters 21 & 22
May 3 FINAL EXAM     (Tuesday, 10:00 - 11:40)