Distributed Algorithms

Code: MA651 | L-T-P-C: 3-0-0-6

Prerequisites: MA512/MA252 or equivalent

Overview of distributed computing, basics of distributed networks algorithms, Time in distributed system, distributed mutual exclusion, distributed snapshot and global state collection, graph algorithms, coordination algorithms, fault and fault-tolerance, distributed consensus and agreement algorithms, distributed transactions, group communication, replicated data management, self-stabilization, applications in wireless sensor networks

Texts:

1. S. Ghosh, Distributed Systems: An Algorithmic Approach, 2nd Edition (Indian Reprint), CRC Press, 2015.
2. D. Peleg, Distributed Computing: A Locality-Sensitive Approach, SIAM, 2000
3. Nancy Lynch, Distributed Algorithms, Morgan Kaufmann, 1996.

References:

1. M. V. Steen, A. Tanenbaum: Distributed Systems, 3rd Edition, Pearson 2017.
2. H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations, and Advanced Topics, Second Edition, Wiley, 2006.
3. G. Tel, Introduction to Distributed Algorithms, Cambridge University Press 2000
4. A. Kshemkalyani, M. Singhal, Distributed Computing: Principles, Algorithms, and Systems, Cambridge University Press, 2007.
5. V. K. Garg, Elements of Distributed Computing, Wiley & Sons, 2002.