Classroom: BYAC 110   Hours: M,W 3:50 - 5:05pm     Line Number: 36157

Textbook:   Operating System Concepts 6th Edition, Silberschatz, Galvin & Gagne, John  and Sons, Inc.                           

Hot News: Last Update: 05/05/2004

    Check regularly (at least once before each class) - complete log is here.

Final exam review sheet is available here. Solve Ex 9.8, 9.10, 9.17, 10.11, 10.16 to be prepared for Final Exam Lecture note 27 is available Regarding Project 3, 2-3 page short reports are required to describe general program design, key classes, key functions, key data structures, how to compile and execute your programs, and features complete or incomplete. Lecture note 26 is available Final Exam is scheduled May 10 (Mon),  4:40PM - 6:30PM Lecture note 25 is available Lecture note 24 is available The link to project 3 description has been fixed. Lecture note 23 is available Project 3 Description is available below. - this is due on 5/3 (Mon) Late submission of Project 2  will be accepted by 3PM Friday, with 20% PENALTY. The extra-credit will not count. Lecture note 22 is available HW#5 due date is extended to 4/19 (Mon) However, for fairness, homework submitted on 4/12 will be given extra 10% unless an updated version is submitted. Lecture note 21 is available Lecture note 20 is available Lecture note 19 is available Project 2: Sample Inputs and Outputs are available below (4/1). Lecture note 18 is available Project 2 has been assigned today (3/31), description available below. - this is due on 4/14 (Wed) Lecture note 17 is available Lecture note 16 is available Lecture note 15 is available Midterm Exam Review sheet is here. Lecture note 14 is available Lecture note 13 is available - 3/3- More Project 1 information is available in Documents/Link section -3/1- Midterm exam will be held in class on 3/10 (Wed) -3/1- Lecture note 12 is available - 3/1- Lecture note 11 is available -2/25- Project 1 description is available: project1.pdf. Find more information in Project section below -2/24- Lecture note 10  is available -2/23- Lecture note 9  is available -2/18- Linux Process Data Structure (PCB) is available in Documents section - 2/18- Lecture note 8  is available -2/15- MS DOS multitasking article is available in Documents section below -2/11- Lecture note 7 is available below. -2/10- System Call list is available in Documents section below -2/9- Lecture note 6 is available below. -2/8- Please, do start-of-semester survey here. -1/26- Lecture note 3 is available below. Lecture notes 1 and 2 are available -1/24- - two slides on one page format is recommended for lecture note printing. Unfortunately, override is not allowed by the CSE dept policy. Syllabus is here. First class is on 1/21, Wednesday. Welcome back to school

Objective:

An in-depth understanding of how an operating system manages resources in a computer and provides programmers with a machine and device independent interface. The emphasis of this class will be on operating system concept.

Handouts:

Lectures:

    * Note that slides may have been modified or corrected after class.
    * Email me if you cannot read the slides due to format problem.

Documents & Links:

• Tentative class schedule
• Linux (kernel 2.2) System call table (Lecture 6)
• A story of multitasking in MS DOS (Lecture 7)
• Linux Process Data Structure (PCB) (Lecture 9)
• UNIX process control (Project 1)
• UNIX shared memory (Project 1)
• Midterm exam review sheet (Midterm Exam)
• How to use Pthread (Project 3)
• A Pthread example (Project 3)
• An example with pthread and semaphore (Project 3)

Homework:

• HW1: Textbook (6th ed), Ch1. Ex: 1.3 1.4 1.6 1.7 1.9 1.11
              In-class Q: Can we run multiple OSs at the same time (concurrently)? If yes, how? existing systems? If not, why?
              Due: 2/4 (Wed), in class (before class starts)
   
• HW2: Textbook (6th ed), Ch2. Ex: 2.1, 2.3, 2.5, 2.7, 2.8
                              Ch3. Ex. 3.5, 3.7, 3.8
              * Ex 3.8: 1. Program, compile (gcc) and run it in Unix/Linux
                             2. Turn in the program source code in hardcopy
              In-class Q: Describe three cache replacement algorithms
              (reference: Patterson & Hennessy's Computer Architecture book)
              Due: 2/25 (Wed), in class (before class starts)
   
• HW3: Textbook, Ch4. Ex. 4.2 4.3 4.6 4.7
                              Ch5. Ex  5.3 5.6
              * Ex 4.7: b. consider using non-blocking receive.
                             c. answer for two different cases: mail box size = 1 and mail box size > 1.
              Due: 3/3 (Wed), in class (before class starts)
   
• HW #4: Textbook, Ch6. Ex. 6.3 6.4 6.7 6.10
              Due: 3/22 (Mon), in class (before class starts)
   
• HW #5: Textbook, Ch7. Write an algorithm for Readers-Writers problem with priority given to writers. And, briefly explain your algorithm.
              Extended Due: 4/19 (Mon), in class (before class starts)
              * For fairness, the homework submitted on 4/12 will be given extra 10%.
• Practice HW for Final Exam (no need for submission):
              Ex. 9.8, 9.10, 9.17, 10.11, 10.16

Projects: (late policy: No late submission will be accepted):

• Project 1: Multi-Process and Shared Memory Management in Unix
      - Description
      - Due: 3/12 (Fri), 3PM (Softcopy by email), 4PM (Hardcopy)
      - Sample program:
          - general cluster (Solaris): sample1.c
      * Shared memory cleanup
          Programming Rule:
              1. if attached shared memory is no longer needed locally, detach it (shmdt)
              2. if allocated shared memory id is no longer needed globally, remove it (shmctl)
              * To clean up your "hanging" shared memory, identify yours using "ipcs", and destroy using "ipcrm -m ".
                (Or use the script provided: ~kryu1/cse430s4/shmrm.sh)
              

• Project 2: CPU Scheduling Simulator
       - Description
       - Due: 4/14 (Mon), 3PM (Softcopy by email), 3:50PM (Hardcopy in class)           
       - Sample input/outputs: Sample1 (for FCFS, RR, and SRTF), Sample2 (for RMS and RMA)
   

• Project 3: Multithreaded Timer
      - Description
      - 2-3 page short reports are required to describe general program design, key classes, key functions, key data structures, how to compile and execute your programs, and features complete or incomplete.
      - Due: 5/3 (Mon), 2PM (Softcopy by email), 3:15PM (Hardcopy)           
      - Sample program: readwrite.c (compile with "gcc readwrite.c -lrt -lpthread")
      - Sample input/outputs: sample3
      - Reference Links:
          - How to use Pthread
          - A Pthread example
          - An example with pthread and semaphore
      - Reference book:
           - Pthread Programming, Nichols, Buttlar & Farrell (O'Reilly)
           - Multithreaded Programming with Pthreads, Lewis and Berg (Prentice Hall)
   

Exams:

Academic Integrity:

"Integrity without knowledge is weak and useless, and knowledge without integrity is dangerous and dreadful." Samuel Johnson (The History of Rasselas, ch. 41 (1759)).

Please read the statement on academic integrity.

Copyright:

This page will be updated throughout the class to provide online access to course materials. This page and all problem sets, lecture notes, and exams linked to it are copyrighted. Use of these pages for the class CSE430 at ASU is permitted. Any other use requires permission of the author (Kyung (Ken) Ryu, kdryu@asu.edu).