Abstract
In a network of asynchronous processors, the cost to send a message can differ significantly from one communication link to another. Assume that associated with each link is a positive weight representing the cost of sending one message along the link and the cost of an algorithm executed on a weighted network is the sum of the costs of all messages sent during its execution. We present a distributed Minimum Cost Spanning tree algorithm that is optimal with respect to this cost measure.
On leave from Odense University, Denmark
This research was carried out in part while visiting the University of Odense whose support is gratefully acknowledged, as well as that of the Natural Sciences and Engineering Research Council of Canada.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
B. Awerbuch. Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pages 230–240, 1987.
B. Awerbuch, A. Baratz, and D. Peleg. Cost-sensitive analysis of communication protocols. In Proc. 9th Annual ACM Symp. on Principles of Distributed Computing, pages 177–187, 1990.
H. L. Bodlaender. A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors. Information Processing Letters, 27(6):287–290, 1988.
F. Chin and H. F. Ting. An almost linear time and O(n lg n + e) messages distributed algorithm for minimum weight spanning tree. In Proc. 26nd Annual Symp. on Foundations of Comput. Sci., pages 257–266, 1985.
M. Faloutsos and M. Molle. Optimal distributed algorithm for minimum spanning trees revisited. In Proc. 14th Annual ACM Symp. on Principles of Distributed Computing, pages 231–237, 1995.
E. Gafni. Improvements in the time complexity of two message-optimal election algorthms. In Proc. 4th Annual ACM Symp. on Principles of Distributed Computing, pages 175–184, 1985.
R. Gallager, P. Humblet, and P. Spira. A distributed algorithm for minimum weight spanning trees. ACM Trans. on Prog. Lang. and Systems, 5(1):66–77, 1983.
L. Higham and T. Przytycka. Asymptotically optimal election on weighted rings. In Lecture Notes in Computer Science #824, pages 207–218. Springer Verlag, 1994. SWAT94, revised version to appear in SIAM J. Comp.
J. Pachl, E. Korach, and D. Rotem. Lower bounds for distributed maximum finding. J. Assoc. Comput. Mach., 31(4):905–918, 1984.
G. Singh and A. J. Bernstein. A highly asynchronous minimum spanning tree protocol. Distributed Computing, 8(3):151–161, 1995.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Przytycka, T., Higham, L. (1996). Optimal cost-sensitive distributed minimum spanning tree algorithm. In: Karlsson, R., Lingas, A. (eds) Algorithm Theory — SWAT'96. SWAT 1996. Lecture Notes in Computer Science, vol 1097. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61422-2_136
Download citation
DOI: https://doi.org/10.1007/3-540-61422-2_136
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61422-7
Online ISBN: 978-3-540-68529-6
eBook Packages: Springer Book Archive