1. Distributed systems II Closing
Prof Philippas Tsigas
Distributed Computing and Systems Research Group
Distributed systems II Closing

2. What do I need to study? Chapters:
Read all material from the Chapters 15, 16, 17 and 18th (edition 5) and the following extra material for Chapter 15:
(Byzantine Agreement Proof)
(two generals) 2

3. What do I need to study? (cnt.)
Chapter 1, 3 and 5 of the Master's Thesis. ( 3

4. What do I need to study? (cnt.2)
While reading this thesis it is good to check also the following papers:
Dijkstra, E. W. (1971, June). Hierarchical ordering of sequential processes. Acta Informatica 1(2):
Chandy, K.M.; Misra, J. (1984). The Drinking Philosophers Problem. ACM Transactions on Programming Languages and Systems.
Nancy A. Lynch. Upper bounds for static resource allocation in a distributed system Journal for Computer and System Sciences, 23: , 1981
Manhoi Choy and Ambuj K. Singh. Efficient fault-tolerant algorithms for distributed resource allocation. ACM Transactions on Programming Languages and Systems, 17(3): , May 1995.
Ernest Chang; Rosemary Roberts (1979), "An improved algorithm for decentralized extrema-finding in circular configurations of processes", Communications of the ACM (ACM) 22 (5): 281–283 (for leader election on rings), 4

5. How to answer the exam questions?
Write Pseudocode together with the informal description.
Write formal statements, when giving proofs, complexity analysis. 5

6. Lectures The slides are there. Check also the NEWS page of the course.6

7. Labs and Assignments Last deadline today.
Last week was scheduled to give you time to finish labs and prepare for exams. 7

8. Questions? 8