{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

DS_10_Coordination_tut - and may give a better performance...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS3283 Distributed Systems Tutorial on Coordination Some points for further considerations: - Differences between agreement and coordination - The importance of mutual exclusion - Requirements, performance considerations, assumptions and operations for mutual exclusion - The performance of central server method - Assumptions and performance of the ring-based method - Differences between the multicast and Maekawa’s algorithms - What is an election? - The performance of the ring-based method - The assumptions of the Bully algorithm - The purposes and objectives of consensus - The Byzantine General problem and its solution Readings : Dollimore: ch12.1 to ch12.3 and ch12.5 (except 12.5.2 & 12.5.4), Tanenbaum: ch5.4 and ch5.5 Question 1 If we look at the performance of the central server algorithm, it seems that it is simpler in implementation
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: and may give a better performance comparing with multicast algorithm as its number of message for synchronization is similar. Discuss the main performance tradeoffs between the use of central server and the multicast method. Question 2 Why deadlock is possible in the Maekawa’s algorithm but not possible in the multicast algorithm? Give an example deadlock case using the Maekawa’s algorithm. Question 3 Explain the main differences in mechanisms between the Maekawa’s algorithm and the multicast algorithm. Question 4 What are the assumptions of the Bully algorithms? Question 5 What are the requirements the consensus problem?...
View Full Document

{[ snackBarMessage ]}