CSC 2221 --- Introduction to Distributed Computing

Some lecture notes and handouts

• General Course Information
• Course Syllabus
• 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
• Ben-Or's Algorithm -- Strong Adversary Proof
  
• Unsolvability of Consensus in Asynchronous Systems
• Unreliable Failure Detectors for Reliable Distributed Systems
• Lecture on Failure Detectors (Transparencies in powerpoint)
• Lecture on Failure Detectors (Transparencies in pdf)
• Leader Election: Algorithms and Implementations
  
• 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