scientific article; zbMATH DE number 4050991
[For the entire collection see Zbl 0638.00039.] Traversal and election are two fundamental tasks in distributed systems. A traversal algorithm enables a processor to send a message from node to node around the system. An election algorithm ends with some processor in a distinguished state (the leader). Traversal is a task which is executed locally, while an election algorithm requires global coordination among processors. In this paper, we present a general technique for using traversal algorithms to construct election algorithms. The algorithm simplifies and improves the previously known technique of Korach, Kutten and Moran.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3787480)