This preview has intentionally blurred sections. Sign up to view the full version.View Full 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
- Spring '10
- Distributed Computing, tanenbaum, multicast algorithm