Constructing efficient election algorithms from efficient traversal algorithms

descriptionPublicationkeyboard_double_arrow_right Part of book or chapter of book , Conference object , Article 01 Jan 1988Publisher:Springer Berlin Heidelberg

Authors: Hagit Attiya;

doi: 10.1007/bfb0019814

Constructing efficient election algorithms from efficient traversal algorithms

- Summary
- Metrics

Abstract

Traversal and Election are two foundamental 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 simplifys and improves the previously known technique of [KKM].

Related Organizations

Hebrew University of Jerusalem
Israel

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average