Abstract
This paper introduces a transformer for improving the communication complexity of several classes of distributed algorithms. The transformer takes a distributed algorithm whose message complexity is O(f·m) and produces a new distributed algorithm for the same problem with O(f·n log n + m log n) message complexity, where n and m are the total number of nodes and links in the network, and f is an arbitrary function of n and m.
Applying our paradigm to the standard all shortest paths algorithm [15, 16, 22] yields a new algorithm which solves the problem in O(n 2log n) messages (The previous best that we know of is O(m·n) messages). When applied to the O(m·polylogn) breadth-first search algorithm of Awerbuch and Peleg [8] our paradigm yields an O(m+n·polylogn) messages algorithm.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Y. Afek, B. Awerbuch, and E. Gafni. Applying static network protocols to dynamic networks. In Proc. of the 28th IEEE Annual Symp. on Foundation of Computer Science, pages 358–370, October 1987.
Y. Afek, B. Awerbuch, S. Plotkin, and M. Saks. Local management of a global resource in a communication network. In Proc. of the 28th IEEE Annual Symp. on Foundation of Computer Science, pages 347–357, October 1987.
Y. Afek and M. Ricklin. Sparser: A paradigm for running distributed algorithms. Extended abstract submitted to FOCS-90, April 1990.
B. Awerbuch. Complexity of network synchronization. Journal of the ACM, 32(4):804–823, October 1985.
B. Awerbuch. A new distributed depth-first-search algorithm. Information Processing Letters, 20(3):147–150, April 1985.
B. Awerbuch and R. Gallager. Distributed bfs algorithms. In Proc. of the 26th IEEE Annual Symp. on Foundation of Computer Science, October 1985.
B. Awerbuch, A. Goldberg, M. Luby, and S. Plotkin. Network decomposition and locality in distributed computation. In Proc. of the 30th IEEE Annual Symp. on Foundation of Computer Science, pages 364–369, October 1989.
B. Awerbuch and D. Peleg. Efficient distributed construction of sparse covers. Technical report, Weizman Institute of Science, Dep. of Computer Science, July 1990.
B. Awerbuch and D. Peleg. Network synchronization with polylogarithmic overhead. In Proc. of the 31st IEEE Annual Symp. on Foundation of Computer Science, October 1990.
B. Awerbuch and D. Peleg. Sparse partitions. In Proc. of the 31st IEEE Annual Symp. on Foundation of Computer Science, October 1990.
D. P. Bertsekas and R. G. Gallager. Data Networks. Prantice Hall, 1987.
K. M. Chandy and L. Lamport. Distributed snapshots: Determining global states of distributed systems. ACM Trans. on Computer Systems, 3(1):63–75, January 1985.
W. Dijkstra and C. S. Scholten. Termination detection for diffusing computations. Information Processing Letters, 11–1:1–4, August 1980.
A. Ephremides. The routing problem in Computer Networks. Springer Verlag, 1986.
R. G. Gallager. A shortest path routing algorithm with automatic resynch. Unpublished note, March 1976.
R. G. Gallager. Distributed minimum hop algorithms. Technical Report LIDS-P-1175, M.I.T. Lab for Information and Decision Systems, January 1982.
R. G. Gallager, P. A. Humblet, and P. M. Spira. A distributed algorithm for minimum weight spanning trees. A CM Trans. Program. Lang. Syst., 5:66–77, January 1983.
J. Jaffe and F. Moss. A responsive distributed routing protocol. IEEE Trans. on Communication, COM-30(7, part II):1758–1762, July 1982.
J. M. McQuillan, I. Richer, and E. C. Rosen. The new routing algorithm for the arpanet. IEEE Trans. on Communication, COM-28(5), May 1980.
U. Pape. Implementation and efficiency of moor-algorithms for the shortest route problem. Mathematical Programming, 7:212–222, 1974.
D. Peleg. Sparse graph partitions. Technical Report CS89-01, Dep. of Applied Math. The Weizmann Institute, Rehovot, Israel, February 1989.
A. Segall. Distributed network protocols. IEEE Trans. on Information Theory, IT-29(1), January 1983.
J. M. Spinelli. Broadcasting topology and routing information in computer networks. Master's thesis, MIT, March 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Afek, Y., Ricklin, M. (1992). Sparser: A paradigm for running distributed algorithms. In: Segall, A., Zaks, S. (eds) Distributed Algorithms. WDAG 1992. Lecture Notes in Computer Science, vol 647. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56188-9_1
Download citation
DOI: https://doi.org/10.1007/3-540-56188-9_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56188-0
Online ISBN: 978-3-540-47484-5
eBook Packages: Springer Book Archive