CE 40-442: Operating Systems

Description:

Acknowledgment:

Policies:

• Grading policy is as follows. This is tentative.
  • 25% Homeworks
    
  • 40% Group Homeworks
    
  • 15% Midterm
    
  • 25% Final
    
  
  There will be no exceptions to the following rules:
  
  • If you turn in your assignments one day late you will loose 25% of the grade, two days will cost you 50% and three days 75% of the grade. No submissions will be accepted after the third day. Penlaty may be calculted continusly and per hour of delay.
  • Cell Phones must be turned off when you are in class.
  • There will be a zero tolerance policy for cheating/copying HWs. The first time you are caught, you will receive a zero for the task at hand. If you are caught for a second time, you will fail the course.
    
  • Providing your assignment to someone else is considered cheating on your behalf.
    

Announcements:

• Midterm will be on 1396/9/4, up to "Caching" (lecture 12, slide 27).
• Midterm Grades
• Midterm + Final Exam Grades
  
  

Homeworks:

• HW0, Deadline: 1395/7/5, 11:59PM.
• HW1, Deadline: 1396/7/20, 11:59PM.
• HW2 HW2 (page 10, addition in bold), Deadline: 1395/8/4, 11:59PM.
• HW3 Available: 1396/8/13, Deadline: 1396/8/23, 11:59PM.

Group Homeworks:

• GHW 1: GHW1 PintOS document, Available: 1396/7/15, Design Deadline: 1396/7/25 1396/8/1, Code Submission Deadline: 1396/8/7 1396/8/14, Final Report Submission: 1396/8/10 1396/8/16, 11:59PM.
• GHW 2: GHW2 Available: 1396/8/13, Design Deadline: 1396/8/26 1396/9/1, Code Submission Deadline: 1396/9/11 1396/9/19, Final Report Submission: 1396/9/13 1396/9/21, 11:59PM.
• GHW 3: GHW3 Available: 1396/9/17, Design Deadline: 1396/9/26 1396/10/3, Code Submission Deadline: 1396/10/4 1396/10/11, Final Report Submission: 1396/10/6 1396/10/13, 11:59PM.

Course Material:

-6/25

• Lecture 1- What is an Operating System [PDF]

-6/27

• Lecture 2- Introduction to the Process [PDF]

-7/1

• Lecture 3- Processes (con’t), Fork, Introduction to I/O [PDF]

-7/3

• Lecture 4- Introduction to I/O, Sockets, Networking [PDF]

-7/10

• Lecture 5- Introduction to Networking (Finished),
Concurrency (Processes and Threads) [PDF]

-7/15

• Lecture 6- Concurrency (Continued),
Synchronization (Start) [PDF]

-7/17

• Lecture 7- Synchronization [PDF]
  • The Bug Heard round the World, John R. Garman, ACM SIGSOFT Software Engineering Notes, Vol 6 No 5, Oct 1981
  • Medical Devices: The Therac-25, Nancy Leveson, Safeware: System Safety and Computers, Adison-Wesley, 1995

-7/22

• Lecture 8- Locks, Semaphores, Monitors, and
Quick Intro to Scheduling [PDF]

-7/24

• Lecture 9- Synchronization Continued,
Readers/Writers example,
Scheduling [PDF]

-7/29

• Lecture 10- Scheduling [PDF]
  • Understanding the Linux 2.6.8.1 CPU Scheduler, Josh Aas, Silicon Graphics, Inc. (SGI), 17th February 2005

-8/1

• Lecture 11- Scheduling (Finished),
Deadlock, Address Translation [PDF]

-8/6

• Lecture 12- Address Translation [PDF]

-8/8

• Lecture 13- Address Translation (Finished),
Caching [PDF]

-8/13

• Lecture 14- Caching (Finished),
Demand Paging [PDF]

-8/15

• Lecture 15- Demand Paging (Finished) [PDF]
  • How Anomalous Is Belady's Anomaly?, K. McMaster, S. Sambasivam, N. Anderson, Issues in Informing Science and Information Technology, 2009.

-8/20

• Lecture 16- Demand Paging (Finished), General I/O [PDF]

-8/22

• Lecture 17- Performance
Storage Devices, Queueing Theory [PDF]

-8/27

• Lecture 18- File Systems [PDF]

-8/29

• Midterm Review

-9/4

• Midterm

-9/11

• Lecture 19- File Systems (Con’t),
MMAP, Buffer Cache [PDF]

-9/13

• Lecture 20- Reliability, Transactions
Distributed Systems [PDF]

-9/18

• Lecture 21- Distributed Decision Making
[PDF]

-9/20

• Lecture 22- Distributed Storage,
Key-Value Stores [PDF]