CSC 2221 --- Introduction to Distributed Computing

Lecture notes and Handouts

• Course Information
• Course Topics
• A Simple TRB Algorithm
• An Early-Stopping TRB Algorithm
• A t+1-round Lower Bound Proof for TRB
• Transformations between Consensus and TRB
• TRB and Consensus with Arbitrary Failures
• A Modular Approach to Fault-Tolerant Broadcasts
• A Modular Approach to Fault-Tolerant Broadcasts - 2 per page
• Ben-Or's Algorithm and Weak Scheduler Proof
• Unsolvability of Consensus in Asynchronous Systems
• Unreliable Failure Detectors for Reliable Distributed Systems
• Lecture on Failure Detectors (Transparencies in PostScript)
• Lecture on Failure Detectors (Transparencies in Powerpoint)
• Link to Leslie Lamport's ``Paxos made simple'' paper
• Mutual exclusion --- Part 1 (with atomic shared registers)
• Mutual exclusion --- Part 2 (with safe shared registers)

 

Homeworks

• Homework 1
• Homework 2
• Homework 3
• Homework 4

Announcements

• Dec 1 --- Homework #4 due date:   Homework #4 is now due on Mon Dec 11, 5pm in SF 2304 B or C.

• Nov 7 --- Nov 10 lecture cancelation:   There will be no lecture for this course on Fri Nov 10. The next lecture will be on Fri Nov 17, 2-5. If you have any questions about Homework #3 (which is due at that time), please contact us to arrange a meeting.

• Sep 21 --- Change in class meeting time:   The class will be meeting on Fridays 2-5, starting tomorrow, Fri Sep 22. The location remains RS 310.