Title :
Distributed coin tossing
Author :
Vernadat, François ; Azema, Pierre ; Drira, Khalil
Author_Institution :
Lab. d´´Autom. et d´´Anal. des Syst., CNRS, Toulouse, France
Abstract :
This paper presents algorithms for distributed coin tossing. Distributed coin tossing furnishes a symmetrical way to break the symmetry in a distributed system. They allow the conflicts arising from competing remote sites to be overcome in a fair (equiprobable) manner: any site has an equal chance of being selected. It as also shown how these algorithms may be used to obtain a total order between competing sites of a system. Moreover, in each case the outputs of our algorithms are totally unpredictable
Keywords :
distributed algorithms; fault tolerant computing; message passing; software reliability; stochastic processes; system recovery; competing sites; conflict resolution; distributed algorithms; distributed coin tossing; remote sites; static priority; timestamp messages; Communication networks; Condition monitoring; Distributed algorithms; Fault tolerance; Network topology; Nominations and elections;
Conference_Titel :
Distributed Computing Systems, 1994., Proceedings of the 14th International Conference on
Conference_Location :
Pozman
Print_ISBN :
0-8186-5840-1
DOI :
10.1109/ICDCS.1994.302419
