CPS 536 Operating Systems I
This is a graduate level course that covers a broad range of concepts in
operating systems. This is a fast paced course involving
both the study and implementation of features found in modern
operating systems.
Instructor
Dr. Russell J Clark
( rjc@cps.udayton.edu)
Readings
- Week 1 : Text Ch 1, 2.1 - 2.2, 3.1 - 3.5, Appendix A
- Week 2 : Text Ch 4.1 - 4.5, Nachos Roadmap
- Week 3 : Text Ch 6.1 - 6.4
- Week 4 : Text Ch 5.1 - 5.5
- Week 5 : Text Ch 2.5 - 2.6
- Week 6 : Exam 1
- Week 7 : Text Ch 8.1 - 8.3
- Week 8 : Text Ch 8.4 - 8.6
- Week 9 : Text Ch 9.1 - 9.7
- Week 10 : Project discussions, no new reading
- Week 11 : Exam 2
- Week 12 : Project discussions, no new reading
- Week 13 : Text Ch 10.1 - 10.6
- Week 14 : Text Ch 11.1 - 11.5, 12.1 - 12.3, 12.5
- Week 15 : Selected sections on Interprocess Communication
Projects
Available Documents
Spring 1997
Useful Links
Prerequisites
CPS 350 Data Structures and Algorithms or equivalent.
While it is not required that
you have had an undergraduate operating systems class, this
course will spend less time on the fundamentals covered in an undergraduate
class and focus more on implementation and coverage of diverse systems.
A large amount of programming using C and C++ on a UNIX system
will be required for homework projects.
Textbook
Silberschatz and Galvin,
Operating System Concepts 4th Edition,
Addison-Wesley, 1994.
Course Objectives
My primary objectives for the students in this class are:
-
To learn the fundamental concepts behind the design and
function of computer operating systems.
-
To understand the details of several operating system
techniques and be able to exhibit that understanding by
implementing the techniques in software.
-
To evaluate different system approaches using performance measurement.
Grading
Grades will be computed on a 90-80-70-60 scale.
The weights assigned to various items are:
-
Programs/Homework: 200 points
-
2 Exams: 200 points
-
Final Exam: 100 points
Topics Covered
- Introduction, history, terminology
- Threads: creation and dispatch
- Synchronization: semaphores and monitors
- Deadlock
- CPU Scheduling
- Address Spaces and Multiprogramming
- Address Translation and Memory Management
- Virtual Memory
- File Systems
- Distributed Applications
- Operating System Structure: micro-kernels
You are visitor number
since Jan 1, 1997.
Last updated .