CS 551: Distributed Operating Systems
Election Algorithms

Election Algorithms

Many of the algorithms for distributed systems require some centralization,
    some site with leader/coordinator activities.

All other sites need to recognize this leader;
    often there is accomplished by an initial agreement/election.
When the site of the leader fails or goes down for some reason,
    it is necessary to elect a new leader.

This is the purpose of election or agreement algorithms.

There are two basic criteria for an election/agreement algorithm.

Assumptions for most election algorithms:

The following pages discuss a few such algorithms:

Yet another algorithm is related to the Byzantine General paper by Lamport et al.

Copyright © 2001-2003: Colorado State University for CS 551. All rights reserved.