TENTATIVE CLASS SCHEDULE


I. Theoretical Foundations 

    8/28	Introduction (Sc1)
    8/30        Wave algorithms (T6.1,6.2)

    9/4		Network Simulation, first project assingment
    9/6 	Traversal algorithms (T6.3)

    9/13
    9/15	Synchronizing physical clocks (S6.2)

    9/18  	Logical clocks (5.1-5.5)
    9/20        Global State recording (5.6,5.7)



II. Synchronization and Agreement

    9/25  P1    Termination detection (5.8, T8)                
    9/27	Distributed mutual exclusion:
                permission-based algorithms (6.1-6.8)                

    10/2  H1	Distributed mutual exclusion: 
                token-based algorithms (6.10-6.13)
    10/4	Exam 1

    10/9 	Distributed deadlock detection (7.1-7.6)
    10/11	Distributed deadlock detection, cont. (7.7)

    10/16	Agreement (8.1-8.3)
    10/18       Agreement, cont. (8.3,8.4) Election (T7)


III. Resource Management

    10/23 P2    Remote procedure calls (4.7)
    10/25	Distributed file systems (9.1-9.4)
		DFS examples: NFS, Andrew

    10/30       Distributed Shared memory (10)
    11/1  H2	Distributed Shared memory, cont.

    11/6   	Exam 2
    11/8  	Load distribution (11.1-11.10)

    11/13  	Process migration (11.12)
		

IV. Security

    11/15  	Security (15.1-15.7)

    11/20   	Security system implementations: Kerberos, 
                Secure Shell (15.8,15.9)


V. Clusters, High Availability, Scalability

    11/22 

    11/27  P3 	Clusters (P2)       
    11/29   	Scalability
 
    12/04  H3	High Availability, Disaster Recovery (P12)
    12/06    

FINAL EXAM: 12:45-3:00pm on Wednesday, Dec 12 in MSB 276



VI. Other Topics (covered if time allows)

    --- Fault-Tolerance
    --- Concurrency Control
    --- Multiprocessor Operating Systems

-----------------

Chapters from textbooks other than Singhal

  P -- Gregory F. Pfister "In Search of Clusters"
  S -- Pradeep K. Singha "Distributed Operating Systems: Concepts and Design"
  Sc -- Fred B. Schneider "On Concurrent Programming"
  T -- Gerard Tel "Introduction to Distributed Algorithms"