Question 4 Election algorithms, such as the bully algorithm, require one process
ID: 3904450 • Letter: Q
Question
Question 4 Election algorithms, such as the bully algorithm, require one process to act as the coordinator. Suppose that there are 8 processes in the system, which are numbered from 1 to 8. Initially, process 8 was the coordinator. However, it has just crashed. Process 5 is the first one to notice this failure. The behaviour of the bully algorithm in this situation is illustrated below 12 Marks P4 P4 P3 P3 P5 PS Election Answer P2 P2 P6 message P6 message P1 P1 P7 P4 P4 P3 PS P5 Election message P2 P2 Answer P6 message P6 P1 P7 P1 P4 P4 P3 P3 PS P5 rdinato Coordinator P2 P2 P6 P6 P1 P7 P7 P8Explanation / Answer
Initially process 8 is crashed and process 5 notices that 8 has crashed
a) process 5 sends the "ELECTION" message to processes which are having highest process number i.e., 6,7 & 8. If it doesnot receive any response from the processes, process 5 is ready to announce that he is coordinator
b) Now process 6 & 7 sends "OK" message to process 5.
c) Now process 6 sends "ELECTION" message to the processes which are having highest process numbers 7 & 8.If it doesnot receive any response from the processes, process 6 is ready to announce that he is coordinator.
d) Now process 7 sends "OK" message to process 6
e) Now process 7 notices that process 8 is not recovered from failure now process 7 sends "COORDINATOR" message to all the processes.
f) But after some instance of time process 8 is recovered from failure and it sends "COORDINATOR" message to all the processes.
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.