1 / 8

Distributed systems II Closing

Prof Philippas Tsigas Distributed Computing and Systems Research Group. Distributed systems II Closing. 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:

lieb
Télécharger la présentation

Distributed systems II Closing

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Prof Philippas Tsigas Distributed Computing and Systems Research Group Distributedsystems IIClosing

  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: • http://pingpong.chalmers.se/public/pp/public_courses/course03499/published/1393587059733/resourceId/1756187/content/ByzAgreemnent%20Proof.pdf (Byzantine Agreement Proof) • http://pingpong.chalmers.se/public/pp/public_courses/course02284/published/1362560491083/resourceId/1176044/content/p67-akkoyunlu.pdf (two generals) 2

  3. What do I need to study? (cnt.) • Chapter 1, 3 and 5 of the Master's Thesis. (http://pingpong.chalmers.se/public/pp/public_courses/course03499/published/1393586067476/resourceId/1756187/content/Distributed%20Algorithms%20Reading.pdf) 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): 115-138. • 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:254-278, 1981 • Manhoi Choy and Ambuj K. Singh. Efficient fault-tolerant algorithms for distributed resource allocation. ACM Transactions on Programming Languages and Systems, 17(3):535-559, 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 weekwasscheduledtogiveyoutimeto finish labsand prepare for exams. 7

  8. Questions? 8

More Related