CS 4560 OPERATING SYSTEMS: SYLLABUS (Spring 2000) Instructor: Ted Billard Email : ted.billard@csueastbay.edu Phone : 885-3437 Home Page : www.mcs.csueastbay.edu/~billard Class Time: TR Noon-2pm Office Hrs: M 11-Noon, TR 9-10am (Sc N216) Summary: The main focus of the course is on process and memory management, with both theoretical and practical treatments. There is also an introduction to queueing analysis. Lectures cover classical problems and algorithms with notes available at the bookstore. On-line software is available for study and exercises in queueing systems, process management, concurrent programming and memory management. There is an emphasis on programming in both exercises and the final exam - there are two other exams. Memory simulation will be programmed using C in either a PC or UNIX environment. Classical process problems will be programmed in C in a UNIX environment. Prerequisites: CS 3240 Data Structures, CS 3430 Computer Architecture (student must provide proof by second class) Texts: Instructor's Lecture Notes (ILN) 4560/6560 Operating Systems Concepts, A. Silberschatz and P. Galvin, Addison-Wesley, 1997. (ISBM 0-201-59113-8) Schedule: Date Topic Chapter Exercise 1 3/28 Logical vs. Physical Memory 8 2 3/30 Paging 8 3 4/4 Virtual Memory 9 4 4/6 Design of MEM, Alg: FIFO 9 5 4/11 Algs: OPT, LRU, MFU, LFU 9 6 4/13 Working Set 9 7 4/18 TEST 1 8 4/20 Queueing Models 9 4/25 Queueing Models 10 4/27 Processes 4 11 5/2 CPU Scheduling 5 ExI: Coding of Replacement Algs 12 5/4 Scheduling Algorithms 5 13 5/9 Process Synchronization 6 14 5/11 Classical Problems in VOS 6 ExII: Queueing Analysis 15 5/16 Classical Problems in VOS 6 16 5/18 TEST 2 17 5/23 Busy Bees OS 18 5/25 Design of VOS 5/28 or 5/29: Programming Workshop 9am-Noon 19 5/30 Selected Topics 20 6/1 I/O Subsystem Workshop 12,21 21 6/6 FINAL EXAM ExIII: Coding of Classical Prob. Collaboration/Copying: Unless otherwise stated, do your own work in this class. Violations will be prosecuted to the full extent of the University rules. CS 4560 Operating Systems: EXERCISES (Spring 2000) Notation on Exercises: A) Recommended - learning experience but no grade A) Highly Recommended - better do it but no grade B) Required - for passing grade C) Advanced - additional problems, more challenging, better grade I. Coding of Page Replacement Algorithms with mem1.c B. Required 1.OPT, LRU_REF, LRU_TIME, LFU, MFU, CLOCK C. Advanced 2.LRU_STACK, Enhanced Second Chance II. Queueing Analysis A. Highly Recommended 8a.Modeling (analysis on paper) A. Recommended 10a.I/O Controllers (analysis on paper) III. Coding of Classical Problems with VISUAL OS (VOS) B. Required remote login access 7.Dining Philosophers user 17 8.Producer/Consumer user 19 9.Readers/Writers user 15 10.Cigarette Smokers user 27 11.Deadlock user 9 12.Client/Server user 13 13.Ring Network user 23 14.Star Network user 25 C. Advanced 18.Busy Bee OS [TEAM PROJECT: 2 MEMBERS] user 83 To run VOS with the Graphical User Interface, the student must use the Sun Lab. Remote login access just shows a textual printout. For example, type "user 17" at the UNIX prompt to run the OK version of Dining Philosophers. To run the BAD version (which the student corrects), type "user 18".