OPERATING SYSTEMS SYLLABUS
Course: 33211 | Fall 2003 |
Call Number: 18957 | |
Time: 1:45-3:00pm Tu Th | Location: 121 MSB |
Paul A. Farrell | Office : 258 |
Phone : 672-9060 | Mail address :
farrell@cs.kent.edu |
Office Hours : 3:15pm - 4:00pm Tu Th,
and by appointment | |
Grader: Seung-Su Yang | Mail address: syang |
Office : | Office Hours : |
Goal:
The goal of this course is to provide an
introduction to the internal operation of
modern operating systems. In
particular, the course will cover
processes and threads, mutual
exclusion, CPU scheduling, deadlock,
memory management, and file systems.
If time permits, we may briefly examine
networking and distributed computing,
and perhaps other topics. Students will
use the Nachos instructional operating
system for several programming
projects.
Course Syllabus:
Topics covered will include a selection from the following:
-
Overview of operating systems, functionalities and charateristics of
OS.
-
Hardware concepts related to OS, CPU states, I/O channels, memory
hierarchy, microprogramming
-
The concept of a process, operations on processes, process states,
concurrent processes, process control block, process context.
-
UNIX process control and management, PCB, signals, forks and pipes.
-
Interrupt processing, operating system organisation, OS
kernel FLIH, dispatcher.
-
Job and processor scheduling, scheduling algorithms, process hierarchies.
-
Problems of concurrent processes, critical sections, mutual exclusion,
synchronisation, deadlock.
-
Mutual exclusion, process co-operation, producer and consumer processes.
-
Semaphores: definition, init, wait, signal operations.
-
Use of semaphores to implement mutex, process synchronisation etc.,
implementation of semaphores.
-
Critical regions, Conditional Critical Regions, Monitors, Ada Tasks.
-
Interprocess Communication (IPC), Message Passing, Direct and Indirect
-
Deadlock: prevention, detection, avoidance, banker's algorithm.
-
Memory organisation and management, storage allocation.
-
Virtual memory concepts, paging and segmentation, address mapping.
-
Virtual storage management, page replacemant strategies.
-
File organisation: blocking and buffering, file descriptor, directory
structure
-
File and Directory structures, blocks and fragments, directory tree,
inodes, file descriptors, UNIX file structure.
If time permits we will also consider:
-
Secondary Storage Management, disk components, disk scheduling,
swap-space management.
-
Distributed systems, structures, file systems, distributed coordination
-
Protection and Security, access rights, access matrix.
-
Networks, Routing, Connection strategies, remote file systems.
Text:
Abraham Silberschatz, Peter B. Galvin, Greg Gagne,
Operating System Concepts. Sixth edition. Addison-Wesley (2003).
Additional References:
Andrew Tanenbaum, Modern Operating Systems, Prentice Hall.
William Stallings, Operasting Systems, Prentice Hall.
Harvey M. Deitel, An introduction to operating systems. Addison-Wesley.
Andrew Tanenbaum & Albert Woodhull, Operating Systems: Design and Implementation. Prentice-Hall.
Douglas Comer, Operating System Design - The XINU Approach. Prentice-Hall.
A.M. Lister, Fundamentals of Operating Systems. Macmillan (1979).
Nachos References:
Assesment:
Midterm Examination : | 30% |
Final Examination : | 30% |
Assignments (2 to 6) : | 40% |
Notes:
-
Assignments will be a mix of programs, algorithms, or questions.
-
Some of the assigments will consist in programming modules
of an operating systems in C++ using the Nachos package.
-
There will be a penalty for late assignments which may amount to 10% per day.
-
The Midterm examination will be in the 7th, 8th, 9th or 10th week of term.
-
Assignments are to be completed by the student without assistance from
or collaboration with other persons.
-
The final examination is scheduled for
12:45pm - 3:00pm on Thursday December 11.
It will not
be comprehensive although some knowledge of the material examined in
the mid-term may be required.
Additional Requirements:
Students with Disabilities:
In accordance with University policy, if you have a documented disability
and require accommondations to obtain equal access in this course,
please contact the instructor at the beginning of the semester or when
given an assignment for which an accommodation is required. Students
with disabilities must verify their eligibility through the Office of
Student Disabilty Services (SDS) in the Michael Schwartz Student
Services Center.