A distributed ring orientation algorithm

Violet Syrotiuk, Jan Pachl

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Scopus citations

Abstract

An asynchronous distributed algorithm for finding a consistent orientation in a ring of anonymous processes is described and analyzed. In rings of size N, when the orientation of each process is chosen at random independently of other processes, the algorithm sends O(N 3/2) messages on average.

Original languageEnglish (US)
Title of host publicationDistributed Algorithms - 2nd International Workshop, Proceedings
PublisherSpringer Verlag
Pages332-336
Number of pages5
Volume312 LNCS
ISBN (Print)9783540193661
DOIs
StatePublished - Jan 1 1988
Externally publishedYes
Event2nd International Workshop on Distributed Algorithms, WDAG 1987 - Amsterdam, Netherlands
Duration: Jul 8 1987Jul 10 1987

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume312 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other2nd International Workshop on Distributed Algorithms, WDAG 1987
CountryNetherlands
CityAmsterdam
Period7/8/877/10/87

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'A distributed ring orientation algorithm'. Together they form a unique fingerprint.

  • Cite this

    Syrotiuk, V., & Pachl, J. (1988). A distributed ring orientation algorithm. In Distributed Algorithms - 2nd International Workshop, Proceedings (Vol. 312 LNCS, pp. 332-336). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 312 LNCS). Springer Verlag. https://doi.org/10.1007/BFb0019813