California Sate University, San Bernardino
CS 660 Operating Systems Concepts & Theory

Instructors : Dr. Tong Lai Yu

Objectives : This course is intended for a second course on operating systems and to provide a basic foundation in the design of advanced operating systems. It stresses on various alternative approaches to the solution of problems encountered in designing process.

Text : M. Singhal and N.G. Shivaratri, Advanced Concepts in Operating Systems, McGraw-Hill, 1994.

Suggested References :

  1. A.S. Tanenbaum, Modern Operating Systems, Prentice Hall, 3rd Edition, 2008.
  2. A.S. Tanenbaum, Distributed Operating Systems, Prentice Hall, 1995.
  3. Silberschatz and Galvin, Operating System Concepts, latest edition, Addison-Wesley Publishing Company.
  4. Deitel, Deitel, and Choffnes, Operating Systems, 3rd Edition, PEARSON Prentice Hall, 2004.
Office : JB-346    phone : (909)-537-5334

Office Hours :

Tue : 11 am - 12 pm, 2:30 - 4 pm,     Thu : 10:30 am - 12 pm, 9:20 - 10:00 pm.

Grading : Lab and Homework -- 40%, Mid Term -- 25%, Final Exam -- 35%

Grade Requirements :

    91 - 100 % A, A-     81 - 90 % B+, B, B-     71 - 80 % C+, C, C-
    61 - 70 % D+, D, D-     <= 60 % F

Study Policy :

    Students are expected to do the labs and homeworks as assigned. They should attend all the lectures and study all assigned readings. Students should come to ask the instructor for help or suggestions if they encounter any difficulties or doubts in their work. Discussions with fellow classmates are encouraged but lab or homework-copying is strictly forbidden. All work must be turned in on time. No late work will be accepted unless the student can provide acceptable compelling reasons with appropriate documentation. Also, do NOT turn in any lab or homework by email.
    Lab attendance counts! Each lab session carries a certain amount of credit. A student must attend the lab on time and work only on the problems assigned till the end of the session. You may not be able to complete the lab assignments within the time allocated for the lab. In this case, you will need to complete the assigned work outside of the lab session.
Illness :
    A student is responsible for contacting the lecture instructor as soon as possible for providing a satisfactory explanation for missing a scheduled exam or work due to illness or other serious and compelling reasons; documented evidence is required. Otherwise, missed exams or work will be counted as 0%.


Outline of course:

Topics Related Chapter of Text

1. Review and Overview processes and threads, semaphores, monitors, serializer, process synchronization, deadlocks
1, 2, 3

2. Architecture of Distributed Systems client-server computing, message-passing, remote procedure call ( RPC )
4

3. Distributed OS Theories shared resources, global clock, Lamport's Logical clocks, vector clocks, causual ordering of messages
5

4. Distributed Mutual Exclusion various mutual exclusion algorithms, token-based and non-token-based algorithms
6

5. Distributed Deadlock deadlock models and algorithms, deadlock detection and prevention
7

6. Agreement protocols system model, Byzantine agreement problem, agreement algorithms 		8

7. Distributed File Systems and Shared Resources distributed file systems principles, case studies, replications, virtual memories, security issues
9, 10

8. Distributed Scheduling load sharing and balancing, load distribution algorithms, load scheduler
11

9. Recovery backward and forward recovery, check points
12

10. Fault Tolerance commit protocols, voting protocols 		13

11. Protection and Security policies, access control, cryptography, public keys
14, 15

12. Multiprocessor and other advanced operating systems multiprocessor systems, design issues, database operating systems, concurrency control
16, 17, 18