Election in a Complete Network with a Sense of Direction

  title={Election in a Complete Network with a Sense of Direction},
  author={Michael C. Loui and Teresa A. Matsushita and Douglas B. West},
  journal={Inf. Process. Lett.},
Consider a complete network of N asynchronous processors. Every pair of processors is joined by a bidirectional link. Each processor has a unique integer identifier ( id) . The Election Problem is to identify the processor with the largest id. Fix a Hamiltonian cycle that includes all the processors. The network has a sense of direction [6] if at each processor the label on each link gives the distance along this Hamil tonian cycle to the processor at the other end of the link. In particular… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
21 Citations
7 References
Similar Papers


Publications referenced by this paper.
Showing 1-7 of 7 references

Efficient algorithms for elections in meshes and complete networks, Tech. Rept. TR-140

  • G. L. Peterson
  • Dept. of Computer Science, Univ. of Rochester,
  • 1984
1 Excerpt

O(n) election algorithms in complete graphs with sense of direction

  • J. Sack, N. Santoro, J. Urrutia
  • Tech. Rept. SCS-TR-49, Carleton Univ.,
  • 1984

Simple and efficient distributed algorithms for election in complete networks

  • Y. Afek, E. Gafni
  • Proc. 22nd Ann. Allerton Conf. on Communication…
  • 1984
1 Excerpt

( n log n ) unidirectional algorithm for the circular extrema problem , ACM Trans

  • G. L. Peterson, O An
  • Programming Language Systems

Similar Papers

Loading similar papers…