Suggest how to adapt the Bully algorithm to deal with temporary network partitions (slow communication) and slow processes.
What will be an ideal response?
With the operating assumptions stated in the question, we cannot guarantee to elect a unique process at any time. Instead, we may find it satisfactory to form subgroups of processes that agree on their coordinator, and allow several such subgroups to exist at one time. For example, if a network splits into two then we could form two subgroups, each of which elects the process with the highest identifier among its membership. However, if the partition should heal then the two groups should merge back into a single group with a single coordinator.
The algorithm known as the ‘invitation algorithm’ achieves this. It elects a single coordinator among each subgroup whose members can communicate, but periodically a coordinator polls other members of the entire set of processes in an attempt to merge with other groups. When another coordinator is found, a coordinator sends it an ‘invitation’ message to invite it to form a merged group. As in the Bully algorithm, when a process suspects the unreachability or failure of its coordinator it calls an election.
You might also like to view...
Members can use Pinterest to share music with their family and online friends
Indicate whether the statement is true or false
A relationship where a record in the first table can have many associated records in the second table is a ________ -to-many relationship
Fill in the blank(s) with correct word
Briefly explain how search engines allow you to refine and control the type of information returned from searches.
What will be an ideal response?
?Even though U.S. law has a(n) ____ provision that allows students to use limited amounts of copyrighted information in term papers, you should always cite your sources.
A. ?escape clause B. ?fair use C. ?Freedom of Information Act D. ?lien