This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Elections in a Distributed Computing System
January 1982 (vol. 31 no. 1)
pp. 48-59
H. Garcia-Molina, Department of Electrical Engineering and Computer Science, Princeton University
After a failure occurs in a distributed computing system, it is often necessary to reorganize the active nodes so that they can continue to perform a useful task. The first step in such a reorganization or reconfiguration is to elect a coordinator node to manage the operation. This paper discusses such elections and reorganizations. Two types of reasonable failure environments are studied. For each environment assertions which define the meaning of an election are presented. An election algorithm which satisfies the assertions is presented for each environment.
Index Terms:
reorganization, Crash recovery, distributed computing systems, elections, failures, mutual exclusion
Citation:
H. Garcia-Molina, "Elections in a Distributed Computing System," IEEE Transactions on Computers, vol. 31, no. 1, pp. 48-59, Jan. 1982, doi:10.1109/TC.1982.1675885
Usage of this product signifies your acceptance of the Terms of Use.