The bully algorithm is an election algorithm that lets a group appoint a co-ordinator in the event of a crash. Whenever a process restarts or joins a group, or whenever the current co-ordinator has crashed, an election is held. The process calling the election sends an election message to all processes of lower rank in the group. Each process receiving an election message replies if it is alive. If the process receives no replies within reasonable time, then it becomes the new co-ordinator.
Every process receiving an election message holds an election with processes of lower rank.
Of course, it still works if you do it the other way, as we do here. Our Implementation We will implement a simulation of the Bully Algorithm, called Fawlty Towers . Developed hands-on experience with faulty distributed systems. To ensure you get this lab done in time, here is a schedule for spending your time in the lab. For this schedule, let H1 be the hour you arrived in, and let H2 be the hour you'll leave in.