Abstract
In the emerging networked environments computational tasks are encountering situations in which the datasets relevant for a computation exist in a number of geographically distributed databases, connected by wide-area communication networks. A common constraint in such situations of distributed data is that the databases cannot be moved to other network sites due to security, size, privacy or data-ownership considerations. For these situations we need algorithms that can decompose themselves at run-time to suit the distribution of data. In this paper we present two such self-decomposing algorithms for computing minimum spanning tree for a graph whose components are stored across a number of geographically distributed databases. The algorithms presented here range from low granularity to high granularity decompositions of the algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abdel-Wahab, H., Stoica, I., Sultan, F., Wilson, K.: A Simple Algorithm for Computing Minimum Spanning Trees in the Internet. Information Sciences 101(1-2), 47–69 (1997)
Berman, K.A., Paul, J.L.: Fundamentals of Sequential and Parallel Algorithms. PWS Publishing Company (1997)
Mcdiarmid, C., Johnson, T., Stone, H.S.: On finding a minimum spanning tree in a network with random weights. Random Structures and Algorithms 10(1-2), 187–204 (1997)
Gallager, R.G., et al.: A Distributed Algorithm for Minimum-Weight Spanning Trees. ACM Transaction on programming and Systems 5, 66–77
Graham, R.L., Hell, P.: ON the History of the Minimum Spanning Tree Problem. Annals Of the History of Computing 7, 43–57 (1985)
Toica, I., Sultan, F.: Keyes A Hyperbolic Model for Communication in Layered Parallel Processing Environments. Journal of Parallel and Distributed Computing 39(1), 29–45 (1996)
Karger, D.R., Klein, P.N., Targan, R.E.: A randomized linear -time algorithm to find minimum spanning tree. Journal of the Association for Computing Machinery 42/2, 321–328
Nancy, A.: Lynch Distributed Algorithms. Morgan Kaufman Publishers, Inc., San Francisco (1996)
King, V., Poon, C.K., Ramachandran, V., Sinha, S.: An optimal EREW PRAM algorithm for minimum spanning tree verification. Information Processing Letters 62(3), 153–159 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Khedr, A., Bhatnagar, R. (2003). Decomposable Algorithms for Computing Minimum Spanning Tree. In: Das, S.R., Das, S.K. (eds) Distributed Computing - IWDC 2003. IWDC 2003. Lecture Notes in Computer Science, vol 2918. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24604-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-24604-6_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20745-0
Online ISBN: 978-3-540-24604-6
eBook Packages: Springer Book Archive