Parallel and Distributed Algorithms
CS 6/76105, Spring 2003
Textbook: Distributed Algorithms by Nancy A. Lynch
Enrolled Students Email Addresses
Presentations
Title/Slides | Presenter |
Chapter 8, Asynchronous System Model | Mikhail Nesterenko |
Chapter 14, Asynchronous Network Model | Mikhail Nesterenko |
Chapter 15, Asynchronous Network Algorithms Section 15.1 Leader Election in a Ring Section 15.2 Leader Election in an Arbitrary Network Section 15.3 Spanning Tree, Broadcast, Convergecast |
Melanie Agnew |
Chapter 15, Asynchronous Network Algorithms Section 15.4 Breadth First Search, Shortest Path Section 15.5 Minimum Spanning Tree |
Kevin Schaffer |
Chapter 17, Shared Memory vs Networks | Sumit Sukhramani |
Chapter 18, Logical Time | Sudha Elavarti |
Chapter 20, Network Resource Allocation | Vyeni Ghildyal |
Chapter 21, Asyncronous Network Computing with Process Failures | Sindhu Karthikeyan |
Chapter 22, Data Link Protocols | Ken Schmidt |
Chapter 23, Modeling V: Partially Synchronous System Models | Binamra Dutta |
Chapter 24, Mutual Exclusion with Partial Synchrony | Melanie Agnew |
Chapter 25, Consensus with Partial Synchrony | Kevin Schaffer |
M. Nesterenko, A. Arora "Local Tolerance to Unbounded Byzantine Faults" 21st IEEE Symposium on Reliable Distributed Systems, pp. 22-29, Suita, Japan, October 2002, presentation | Mikhail Nesterenko |
Towards Self
Stabilizing Wait Free Shared Memory Objects
|
Sumit Sukhramani |
Data
Replication, Practical Byzantine fault tolerance
|
Sudha Elavarti |
Token
Circulation and Mutual Exclusion in Ad hoc
Mobile Networks
|
Vyeni Ghildyal |
Failure Detectors
|
Sindhu Karthikeyan |
Networking
|
Ken Schmidt |
Group Communication
|
Binamra Dutta |
Other papers from Nancy's course may be found at: http://theory.lcs.mit.edu/classes/6.895/fall02/Handouts_and_papers.html
Old Relevant Courses