The Community for Technology Leaders
14th International Conference on Distributed Computing Systems (1994)
Pozman, Poland
June 21, 1994 to June 24, 1994
ISBN: 0-8186-5840-1
pp: 244-249
F. Vernadat , Lab. d'Autom. et d'Anal. des Syst., CNRS, Toulouse, France
P. Azema , Lab. d'Autom. et d'Anal. des Syst., CNRS, Toulouse, France
K. Drira , 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.<>
INDEX TERMS
distributed algorithms, stochastic processes, system recovery, fault tolerant computing, software reliability, message passing
CITATION

F. Vernadat, P. Azema and K. Drira, "Distributed coin tossing," 14th International Conference on Distributed Computing Systems(ICDCS), Pozman, Poland, 1994, pp. 244-249.
doi:10.1109/ICDCS.1994.302419
96 ms
(Ver 3.3 (11022016))