Course Books (Click here for
library link):
|
|
Distributed Algorithms,
by Nancy A. Lynch |
|
|
Distributed
Computing, by H. Attiya and J. Welch |
|
|
Introduction to
Distributed Algorithms, by G. Tel |
|
|
Distributed Computing: A
Locality-Sensitive Approach, By D. Peleg |
|
|
|
Course Papers:
|
Week
2 |
R. G. Gallager, P. A. Humblet, and P.
M. Spira “A Distributed
Algorithm for Minimum-Weight Spanning Trees” ACM Trans. Program.
Lang. Syst. Vol 5(1),
1983, p. 66-77. |
|
|
Week 3 |
|
|
|
Week 5 |
Leslie Lamport “The part-time
parliament", |
|
|
|
Romain Boichat, Partha Dutta, Svend Frolund, Rachid Guerraoui “Deconstructing Paxos", |
|
|
Week 6 |
Michael J. Fischer,
Nancy A. Lynch, Michael S. Paterson "Impossibility of
Distributed Consensus with One Faulty Process", |
|
|
|
|
Tushar Chandra, Sam Toueg "Unreliable Failure
Detectors for Reliable Distributed Systems", |
|
|
Michael Ben-Or "Another advantage
of free choice (Extended Abstract): Completely asynchronous agreement
protocols", |
|
|
|
Maurice Herlihy "Wait-Free
Synchronization", ACM Transactions on Programming Languages and Systems,
January 1991, 13(1):124-149 |
|
|
|
Hagit Attiya, Amotz Bar-Noy, Danny Dolev, “Sharing memory
robustly in message-passing systems”, Journal of the ACM,
Volume 42(1), January, 1995, p 124 –
142. |
|
|
|
|
|
Latex Links:
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Other Relevant Courses:
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
