Reliable election in broadcast networks

Document Type

Article

Publication Date

1-1-1989

Abstract

Election in a computer network is an operation in which one process is selected from among a group of processes to perform a particular task. An election is characterized by (1) the capacities of the candidates, and (2) the agreement reached by all processes to elect the master. In this paper, we show that election is in fact a very general style of computation. Many problems in computer networks can be solved by means of election. We then examine the election problem in computer networks with broadcast support. Basic design issues of election algorithms are addressed, and a number of election algorithms are presented based on various environments. These algorithms allow all nonfaulty processes to elect one and only one process as the master, and, by changing the definition of the capacities, they can be applied to a variety of problems. © 1989.

Identifier

0024882689 (Scopus)

Publication Title

Journal of Parallel and Distributed Computing

External Full Text Location

https://doi.org/10.1016/0743-7315(89)90034-8

ISSN

07437315

First Page

521

Last Page

540

Issue

3

Volume

7

Grant

ECS-83-04967

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS