CS 414 Course Schedule

During Fall 2003, CS 414 will meet in Hollister B14 from 10:10-11:25 on Tuesday and Thursday

Lecture   DateTopicHWAssignments and Reading.  

Bold denotes Edition 6 of the textbook.  Italics denote Edition 5 of the textbook.

H&P denotes the CS314 text.  H&P is NOT a required 414 text.

1 Week 1Aug 28Course Overview & OS Evolution. Architectural Support for the OSS&G Ch. 1

S&G Ch. 1

Mon 9/1/03, 3:35-4:25

OH255

Optional review session: CS314 material we use in CS414!

This is also the first cs415 slot

Slide set from 314 review session

[Another set of slides from previous year] 

2 Week 2Sep 2I/O Path and Hardware Architectural Support for the OS.  Device driversS&G Ch. 2, H&P Chapter 9

S&G Ch. 2

3Sep 4Race Conditions.  ProcessesS&G Ch. 4.1, 4.2, 5

S&G Ch. 3

4 Week 3Sep 9Threads & SchedulingS&G Ch. 7.1, 7.2

S&G Ch. 4, Ch. 5.1-5.5

5Sep 11Synchronization with hardware instructions.  Atomic load/storeHW1, due Sept. 18

HW1-soln

S&G Ch. 7.3, 7.4

S&G Ch. 6.1-6.3

6 Week 4Sep 16Busy waiting, SemaphoresS&G. Ch. 7.4

S&G Ch. 6.3-6.4

Sep 18Classic Synchronization ProblemsHW2, due Sept 25

HW2-soln

S&G Ch. 7.5,7.6

S&G Ch. 6.5-6.8 (skip 6.9)

8 Week 5Sep 23Monitors, Condition Variables and Language SupportS&G Ch. 7.7

S&G Ch. 6

9Sep 25Deadlocks, Prevention, AvoidanceHW3, due Sept 30

HW3-soln

S&G Ch. 8.1-8.5

S&G Ch. 7.1-7.6

10 Week 6Sept 30Deadlocks, Detection, RecoveryS&G Ch. 8.5-8.7

S&G Ch. 7.6-7.8

11Oct 2Midterm 1, in class

Solutions to exam

Slides from review sessionEverything (including deadlocks, but not deadlock detection and recovery from Sept 30)
12 Week 7Oct 7Networking.  Ethernet and LANs Ethernet: Distributed Packet Switching for Local
Computer Networks.
R. Metcalf and D. Boggs. Communications of the ACM, 19(7): 395-403, July 1976.

S&G. Ch 15.  S&G Ch. 15.  

13 Week 8Oct 9Internet, DNS and IP.  How routing works.  Routers can drop packets: Random Early Detection (RED) mechanism (why, how)HW4, due Oct 21

HW4-sol

End-to-end arguments in system design; J. H. Saltzer, D. P. Reed and D. D. Clark; ACM Trans. Comput. Syst. 2, 4 (Nov. 1984), Pages 277 - 288
Oct 14Fall Break: Oct 11-Oct 14
14Oct 16DNS, simple reliability problems.  How Akamai does web hosting.  IP sprayers and using short-lived DNS records and DNS bind to load-balance

Paul's slide set

S&G Ch 15.4.1.  

How the DNS worksMore DNS stuff

15 Week 9Oct 21TCP Congestion control, UDP and IP multicast.  

Dan's slide set

Ken will be out of town; this lecture will be given by one of the TAs  S&G 15.5 and 15.6
16Oct 23Building reliable network software.  (How TCP can break channels.  Split brain syndrome.  Consistency in a distributed failure detection problem.  Idea of a system membership and failure-detecting service.  Why such a service can solve our consistency problem)S&G Ch. 15.  

Reliability Through Consistency. IEEE Software (Special Issue on Safety and Reliability), May 1995. Ken Birman and Brad Glade

Note: This paper is available in the Engineering Library.  Please read it in the library or make a copy.  Don't check out the volume -- that would be antisocial.  The library should also be able to access it via the IEEE URL, which normally requires individual or institutional membership.

S&G Ch. 15

17 Week 10Oct 28Memory ManagementHW5, due November 4

HW5-soln

S&G Ch. 9

S&G Ch. 8

18Oct 30Virtual Memory.  Page replacement, FIFO, OPT, LRUS&G Ch. 10

S&G Ch. 8

19 Week 11Nov 4Working Set Algorithm, WSOPTS&G Ch. 10.2-10.4

S&G Ch. 8

 

20Nov 6Dynamically linked libraries Shared Libraries in SunOS
21 Week 12Nov 11Midterm 2, in class.

Slides from review session

Solutions to exam.

Cumulative, but with a stress on materials subsequent to prelim1 and not including working set or dynamically linked libraries. 
22Nov 13Introduction to file systems.  Types of files, real and symbolic links, local and remote file systems.  Memory mapped files and how they are used.HW6

Solutions to HW6

S&G Ch. 10, 11, 12.  See H&P for background on disk hardware, DMA, other physical issues.

S&G Ch. 8

 

23 Week 13Nov 18How disks work.  How file systems are represented on the disk.  Pros and cons of reordering requests in a disk driver.

Slides from lecture

S&G Ch. 10, 11, 12.  See H&P for background on disk hardware, DMA, other physical issues.

S&G Ch. 8

 

24Nov 20Distributed file systems: NFS, RAID, NTFS.  Storage area networks.
25 Week 14Nov 25Peer to peer file systems: Napster, Chord,.  PAST and Pastry. PAST paperChord paper.
Nov 26-Dec 1Thanksgiving Recess
26 Week 15Dec 2What are the hot topics in modern operating systems research?  How do CS513, 514 and 614 relate tot his material?  In-class review prior prior to final exam, fill in course evaluations, etc. Bring any questions you may have!  We won't think of this as a formal lecture and you won't see this material on the final.

As an added incentive, Ken will give at least one hint about a final exam problem.

Dec 4First chance to take the Final Exam

10:10-11:25 in class

Solution to final


Closed book, cumulative

A note about memory consistency and the Baker's Algorithm

Dec 17thFinal chance to take the Final Exam: 

9:10-10:25 in Olin 155

Solution to final

Closed book, cumulative

A note about memory consistency and the Baker's Algorithm


Ken Birman