This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 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 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 synchronization is similar....
View Full Document
This note was uploaded on 01/17/2011 for the course CS CS3283 taught by Professor Kylam during the Spring '10 term at City University of Hong Kong.
- Spring '10