You are now going through the dreaded Asteroid belt between Saturn and Jupiter! To make things...

Transcribed Image Text:

You are now going through the dreaded Asteroid belt between Saturn and Jupiter! To make things worse, the leader node elected has named itself "Hal", and this single leader seems to be acting up! Hal is threatening to take over the entire space ship and kill everyone on board! Jeez Louise, you feel like you've seen this movie somewhere! Anyway, to ensure that a single leader node cannot make such decisions, you need multiple leaders in the on-board cluster. Solve the k-leader election problem (for a given value of k). It has to satisfy the following two conditions: • Safety: For each non-faulty process p, p's elected = of a set of k processes with the lowest ids, OR = NULL. • Liveness: For all runs of election, the run terminates AND for each non-faulty process p, p's elected is not NULL. Modify the Bully Algorithm described in lecture to create a solution to the k- Leader Election problem. You may make the same assumptions as the Bully Algorithm, e.g., synchronous network. Briefly discuss why your algorithm satisfies the above Safety and Liveness, even when there are failures during the algorithm's execution. You are now going through the dreaded Asteroid belt between Saturn and Jupiter! To make things worse, the leader node elected has named itself "Hal", and this single leader seems to be acting up! Hal is threatening to take over the entire space ship and kill everyone on board! Jeez Louise, you feel like you've seen this movie somewhere! Anyway, to ensure that a single leader node cannot make such decisions, you need multiple leaders in the on-board cluster. Solve the k-leader election problem (for a given value of k). It has to satisfy the following two conditions: • Safety: For each non-faulty process p, p's elected = of a set of k processes with the lowest ids, OR = NULL. • Liveness: For all runs of election, the run terminates AND for each non-faulty process p, p's elected is not NULL. Modify the Bully Algorithm described in lecture to create a solution to the k- Leader Election problem. You may make the same assumptions as the Bully Algorithm, e.g., synchronous network. Briefly discuss why your algorithm satisfies the above Safety and Liveness, even when there are failures during the algorithm's execution.

Answer rating: 100% (QA)

In distributed computing the bully algorithm is a method for dynamically electing a coordinator or leader from a group of distributed computer processes The process with the highest process ID number ... View the full answer