Election algorithm

ELECTION ALGORITHM

Many distributed algorithm require one process to acts as coordinator, initiator, or otherwise perform some special role.
The goal of an election algorithm is to ensure that when an election starts concludes with all process agreeing on who the new coordinator is to be,
Types of Election Algorithm:
1.      Ring Algorithm
2.      Bully Algorithm


Token Ring Election Algorithm
When any process notice that the coordinator is not functioning, it builds an ELECTION MESSAGE containing its own process number and sends the message to its successor.
Example:
We start with 6 processes, connected in a logical ring. Process 6 is the leader, as it has the highest number.
                       

Process 6 fails.

                                

Process 3 notices that Process 6 does not respond. So it starts an election, sending a message containing its id to the next node in the ring.

                       

Process 5 passes the message on, adding its own id to the message.

                          

Process 0 passes the message on, adding its own id to the message.

                         

Process 1 passes the message on, adding its own id to the message.

                            

Process 4 passes the message on, adding its own id to the message.

                          

When Process 3 receives the message back, it knows the message has gone around the ring, as its own id is in the list. Picking the highest id in the list, it starts the coordinator message "5 is the leader" around the ring.

                          

Process 5 passes on the coordinator message.

                         

Process 0 passes on the coordinator message.

                         

Process 1 passes on the coordinator message.
                                
Process 4 passes on the coordinator message.

                                

Process 3 receives the coordinator message, and stops it.

           
                                
                                         Bully Election Algorithm

When any process notices that the coordinator is no longer responding to request, it initiates an ELECTION. The process holds an ELECTION message as follows:

Example:

We start with 6 processes, all directly connected to each other. Process 6 is the leader, 
as it has the highest number.

                            

Process 6 fails.

                              

Process 3 notices that Process 6 does not respond. So it starts an election, notifying those processes with ids greater than 3.

                                

Both Process 4 and Process 5 respond, telling Process 3 that they'll take over from here.

                      

Process 4 sends election messages to both Process 5 and Process 6.

                      

Only Process 5 answers and takes over the election.

                         

Process 5 sends out only one election message to Process 6.

                            

When Process 6 does not respond Process 5 declares itself the winner.

                              


More topics from Distributed System to read:

DISTRIBUTED SYSTEM

EasyExamNotes.com covered following topics in these notes.
Python Programming ↓ 👆
Java Programming ↓ 👆
JAVA EasyExamNotes.com covered following topics in these notes.
JAVA Programs
Principles of Programming Languages ↓ 👆
Principles of Programming Languages
EasyExamNotes.com covered following topics in these notes.

Practicals:
Previous years solved papers:
A list of Video lectures References:
  1. Sebesta,”Concept of programming Language”, Pearson Edu 
  2. Louden, “Programming Languages: Principles & Practices” , Cengage Learning 
  3. Tucker, “Programming Languages: Principles and paradigms “, Tata McGraw –Hill. 
  4. E Horowitz, "Programming Languages", 2nd Edition, Addison Wesley

    Computer Organization and Architecture ↓ 👆

    Computer Organization and Architecture 

    EasyExamNotes.com covered following topics in these notes.

    1. Structure of desktop computers
    2. Logic gates
    3. Register organization
    4. Bus structure
    5. Addressing modes
    6. Register transfer language
    7. Direct mapping numericals
    8. Register in Assembly Language Programming
    9. Arrays in Assembly Language Programming

    References:

    1. William stalling ,“Computer Architecture and Organization” PHI
    2. Morris Mano , “Computer System Organization ”PHI

    Computer Network ↓ 👆
    Computer Network

    EasyExamNotes.com covered following topics in these notes.
    1. Data Link Layer
    2. Framing
    3. Byte count framing method
    4. Flag bytes with byte stuffing framing method
    5. Flag bits with bit stuffing framing method
    6. Physical layer coding violations framing method
    7. Error control in data link layer
    8. Stop and Wait scheme
    9. Sliding Window Protocol
    10. One bit sliding window protocol
    11. A protocol Using Go-Back-N
    12. Selective repeat protocol
    13. Application layer
    References:
    1. Andrew S. Tanenbaum, David J. Wetherall, “Computer Networks” Pearson Education.
    2. Douglas E Comer, “Internetworking with TCP/IP Principles, Protocols, And Architecture",Pearson Education
    3. KavehPahlavan, Prashant Krishnamurthy, “Networking Fundamentals”, Wiley Publication.
    4. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source Approach”, McGraw Hill.