election - Leader Election CSCI 5105 Foundations of Modern...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
1 CSCI 5105 Foundations of Modern Operating Systems Instructor: Abhishek Chandra 2 Leader Election Why do we need it? Many systems require a coordinator, monitor, initiator, central server, etc. It may not matter who the leader is Examples? 3 Election Algorithms Goal: All processes must agree on the leader after the election Choice of leader Process with the highest ID Process with desired properties, e.g.: resource capacity, location, etc. Question: How do we determine the leader? 4 Bully Algorithm Process with highest ID “bullies” everyone into accepting it as a leader Initiation: A process P sends ELECTION message to all processes with higher ID’s If no one responds, P wins the election If someone responds, it takes over the election Last process remaining becomes the leader Sends a Victory message to everyone
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 5 Bully Algorithm: Initiation 6 Bully Algorithm: Leader Election 7 Bully Algorithm: Properties Assume n processes initially
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/21/2011 for the course CSCI 5105 taught by Professor Staff during the Spring '08 term at Minnesota.

Page1 / 4

election - Leader Election CSCI 5105 Foundations of Modern...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online