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.
For details see Garcia-Molina [1982].
You might also like to view...
Word's ________ tool controls how words are split between two lines
A) Grammar B) Hyphenation C) Spelling D) Thesaurus
A customer is reporting that after removing a laptop from the docking station and bringing it home, the cursor occasionally jumps around the screen while the customer is typing. Which of the following should the technician do to mitigate this issue?
A. Disable the touch pad on the laptop B. Install new keyboard drivers for the laptop C. Install new drivers for the docking station D. Disable the keyboard on the laptop