Instructor: M. Samadzadeh Office: MSCS 215 Phone: 744-5674
Office Hours: 11:30-12:15 Monday, Tuesday, Wednesday, Thursday, Friday,
or by appointment if necessary
TA: Zhu Wang Office: MSCS 225 Phone: 744-9552
E-mail Address: wzhu@cs.okstate.edu
Office Hours: 1:00-2:30 Monday, 1:00-2:30 Wednesday, 1:30-2:30 Thursday,
or by appointment if necessary
Prerequisite: CS 4323, Design and Implementation of Operating Systems I
Primary Text: Gary J. Nutt, Centralized and Distributed Operating Systems, Prentice-Hall, Englewood Cliffs, NJ, 1992.
Optional/Recommended Texts, etc.:
1. M. Maekawa, A. E. Oldehoeft, and R. R. Oldehoeft, Operating Systems: Advanced Concepts, The Benjamin/Cummings Publishing Co., Inc., 1987, Menlo Park, CA.
2. Mukesh Singhal and Niranjan G. Shivaratri, Advanced Concepts in Operating Systems, McGraw-Hill, Inc., New York, NY, 1994.
3. Hagit Attiya and Jennifer Welch, Distributed Computing: Fundamentals, Simulations, and Advanced Topics, 2nd edition, John Wiley & Sons, Inc., Hoboken, NJ, 2004.
4. Lubomir F. Bic and Alan C. Shaw, Operating System Principles, Pearson Education, Inc., Prentice Hall, Upper Saddle River, NJ, 2003.
5. Andrew S. Tanenbaum and Maarten van Steen, Distributed Systems: Principles and Paradigms, 2nd edition, Pearson Prentice Hall, Upper Saddle River, NJ, 2007.
6. Doreen L. Galli, Distributed Operating Systems: Concepts and Practice, Prentice-Hall, Inc., Upper Saddle River, NJ, 2000.
7. Michael Pineto, Scheduling: Theory, Algorithms, and Systems, Prentice-Hall, Inc., a Simon & Schuster Company, Englewood Cliffs, NJ, 1995.
8. Peter Brucker, Scheduling Algorithms, Springer-Verlag, Heidelberg, Germany, 1998.
9. M. Ben-Ari, Principles of Concurrent Programming, Prentice/Hall International, Inc., Englewood Cliffs, NJ, 1990.
10. Gregory R. Andrews, Foundations of Multithreaded, Parallel, and Distributed Programming, Addison Wesley Longman, Inc., Reading, MA, 2000.
11. C. A. R. Hoare (Editor), Developments in Concurrency and Communication, Addison-Wesley Publishing Company, Reading, MA, 1990.
12. Joseph JaJa, An Introduction to Parallel Algorithms, Addison-Wesley Publishing Company, Inc., Reading, MA, 1992.
13. R. Chow and T. Johnson, Distributed Operating Systems an Algorithms, Addison Wesley Longman, Inc., Reading, MA, 1997.
14. Rene David and Hassane Alla, Petri Nets and Grafcet: Tools for Modelling Discrete Event Systems, Prentice Hall, New York, NY, 1992.
15. Charles Crowley, Operating Systems: A Design-Oriented Approach, IRWIN, Chicago, IL, 1997.
16. Lester R. Lipsky, Queueing Theory: A Linear Algebraic Approach, Macmillan Publishing Company, New York, NY, 1992.
17. G. Coulouris, J. Dollimore, and T. Kindberg, Distributed Systems: Concepts and Design, 2nd edition, Addison-Wesley Publishing Company, Menlo Park, CA, 1994.
18. A. M. Lister and R. D. Eager, Fundamentals of Operating Systems, Fifth Edition, Springer Verlag, New York, NY, 1993.
19. S. J. Hartley, Operating Systems Programming, Oxford University Press, New York, NY, 1995.
20. M. Milenkovich, Operating Systems: Concepts and Design, McGraw-Hill Book Company, New York, NY, 1987.
21. D. S. Hochbaum (editor), Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, Boston, MA, 1997.
22. Various Periodical Articles and Technical Publications, e.g., ACM SIGOPS, Special Interest Group on Operating Systems, Operating Systems Review, and Proceedings of ASPLOS (Architectural Support for Programming Languages and Operating Systems).
Course Description: Task systems and concurrent programming. Synchronization and inter-process communication. Theoretical investigation of resource sharing and deadlock. Memory management strategies. Deterministic scheduling algorithms and queueing theory. Distributed operating systems.
Grading: Project 35%
Assignments 10%
Tests (3) 10% each (January 30, February 27, April 2)
Final Examination 25% comprehensive (April 30, 2:00-3:50 PM)
Letter Grades: [90-100] A, [80-90) B, [70-80) C, [60-70) D, [0-60) F
Notes:
(1) Assignments are due at the beginning of class on the date they are due (unless announced in class otherwise). Homework assignments are to be submitted in hard copies, i.e., on paper. Assignment legibility is a requirement. The "word processing and formatting" of the assignments is a recommended option but not a requirement. Late assignments will not be accepted. Only when verifiable extenuating circumstances can be demonstrated will make-up exams or extended assignment due dates be considered. Verifiable extenuating circumstances must be reasons beyond control of the students, such as illness or accidental injury. Poor performance in class is not an extenuating circumstance. Advise your instructor of the verifiable extenuating circumstances in advance or as soon as possible. In such situations, the date and nature of the make-up exams and the extended due dates for the assignments will be decided by the instructor.
(2) A general point about assignments and tests: It is understood and it is always the case that you must justify your answers, show all your work, and state your assumptions on all problems and exercises in the assignments and examinations. A correct answer with no justification and no work shown may be worth less than a wrong answer with full justification and having shown all the work.
(3) Cell phones should be turned off during class and in examination sessions. Computer use (i.e., the use of a laptop, etc.) is not allowed in class unless a clear and convincing case is made for the use of one.
Attendance Policy:
(1) Attendance is strongly encouraged, but not required or monitored. Students are responsible for all material covered in class. Some of the material covered in class will not be in the text book. Announcements about assignments, project due dates, etc. will be made in class and/or by email. Students are to check their CSA email regularly using their class account, i.e., userid@cs.okstate.edu. [Passwords for new accounts on CSA are the PR&SM passwords (PR&SM = Password Reset and System Management) that students can get via their O-Key accounts. If you have a new CSA account, you should use your PR&SM password.] Students are responsible for all announcements made in class and/or by email. Students are to either check their class account email on CSA regularly or to put an appropriate forwarding mechanism in place to make sure to read their class-related email.
(2) Taking a course as a remote student is not the same as taking a correspondence course or taking an on-line course. Although the lectures are generally made available after the fact and may be viewed at the students' leisure, that does not free the students from keeping up with the class. This course has a pace and progress rate that must be followed by all students. The deadlines and due dates apply to all students.
(3) Attending this class requires registration or formal audit, no informal "sitting in" is allowed.
Collaboration Policy for CS 5323
Assignments: Discussion of any kind is allowed. After discussion, each student must write up his/her own solution. Copying another student's work is not allowed. Giving another student your work is considered cheating as well.
Project: Discussion of techniques in a natural language (such as English) is allowed, but a discussion in a computer or algorithmic language is not allowed. Computer language discussions and questions are to be limited to the language and should not concern the assignment. Stealing, giving or receiving any code, drawings, diagrams, texts or designs is not allowed. Every line of work that you turn in must be your own.
Examinations: No discussion of any kind (except with the instructor) is allowed. No access to any type of written material is allowed.
Students who do not comply with the described collaboration policy will receive a grade of F in the course. Furthermore, the case will be reported to the University Officials.
Attachments:
· Spring Semester 2008 Calendar
· Spring 2008 Final Examination Schedule
· Oklahoma State University, Syllabus Attachment , Spring 2008