Kyoto, February, 2018

Petr
Kuznetsov

INFRES, Telecom ParisTech

Slides | Exercises | |
---|---|---|

Class 1 | Introduction, basics of read/write models, snapshots, consensus | Quiz 1 |

Class 2 | Asynchronous computability theorem: wait-freedom, resilience and adversaries | Quiz 2 |

- M. Herlihy, D. Kozlov, and S. Rajsbaum, "Distributed Computing through Combinatorial Topology", Morgan Kaufman, 2014, ebook on Dawsonera.
- R. Guerraoui, P. Kuznetsov. Lecture Notes on Concurrent Computing
- M. Herlihy and N. Shavit. The art of multiprocessor programming. Morgan Kaufman, 2008, ebook
- N. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers. 1996
- H. Attiya, J. Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics (2nd edition). Addison Wesley. 2006