1 / 4

Essential Study Guide for Distributed Systems and Computing Research

This guide outlines key study areas for understanding distributed systems, as emphasized in Prof. Philippas Tsigas's research group. Focus on Chapters 12-15 of the 4th edition of Coulouris et al.'s book, covering Coordination, Transactions, and Replication. Additionally, review pivotal papers, including Dijkstra's hierarchical processes and Chandy-Misra's Philosopher Problem. To prepare for exams, practice writing pseudocode and formal statements. Emphasizing both theoretical and practical applications will enhance comprehension and preparation for distributed computing challenges.

liesel
Download Presentation

Essential Study Guide for Distributed Systems and Computing Research

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: • 12Coordination and Agreement • 13 Transactions and Concurrency Control • 14 Distributed Transactions • 15 Replication (4th edition of the Coulouris et al. book (11, 12, 13, 14 for the 3rd edition)) of the book 2

  3. What do I need to study? (cnt.) • Chapter 3 and 5 of the Master's Thesis. 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. 3

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

More Related