Article

Free access

Communication-optimal parallel minimum spanning tree algorithms (extended abstract)

Authors:

Ingo RiepingAuthors Info & Claims

SPAA '98: Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures

Pages 27 - 36

https://doi.org/10.1145/277651.277662

Published: 01 June 1998 Publication History

PDF eReader

References

[1]

M. Adler, J. W. Byers, and R. M. Karp. Parallel sorting with limited bandwidth. In Annual A CM Symposium on Parallel Algorithms and Architecture, pages 129-136, 1995.

Digital Library

Google Scholar

[2]

M. Adler, W. Dittrich, B. Juurlink, M. Kutytowski, and I. Rieping. Towards an Efficient Minimum Spanning Tree Algorithm. Technical report, University of Paderborn, Computer Science Dept., 1998.

Google Scholar

[3]

B. Awerbuch and Y. Shiloach. New connectivity and MSF algorithms for Shuffle-Exchange network and PRAM. IEEE Transactions on Computers, C- 36(10):1258-1263, 1987.

Digital Library

Google Scholar

[4]

A. B~umker and W. Dittrich. Fully Dynamic Search Trees for an Extension of the BSP Model. In Annual A CM Symposium on Parallel Algorithms and Architecture, 1996.

Digital Library

Google Scholar

[5]

A. B/iumker, W. Dittrich, and F. Meyer auf der Heide. Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model. In Proc. of the Annual European Symposium on Algorithms, 1995.

Digital Library

Google Scholar

[6]

A. B/iumker, W. Dittrich, F. Meyer auf der Heide, and I. Rieping. Realistic parallel algorithms: Priority queue operations and selection for the BSP* model. In Proc. of the Annual International EURO-PAR Conference, LNCS, 1996.

Digital Library

Google Scholar

[7]

G. E. Blelloch. Scans as primitive parallel operations. IEEE Transactions on Computers, pages 1526-1538, 1989.

Digital Library

Google Scholar

[8]

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. Song. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In Annual International Colloquium on Automata, Languages and Programming (ICALP), 1997.

Digital Library

Google Scholar

[9]

K. Chong. Finding Minimum Spanning Trees on the EREW PRAM. Manuscript, 1997.

Google Scholar

[10]

R. Cole, P. N. Klein, and R. E. Tarjan. Finding minimum spanning forests in logarithmic time and linear work using random sampling. In Annual A CM Symposium on Parallel Algorithms and Architecture, pages 243-250. ACM, 1996.

Digital Library

Google Scholar

[11]

D. Culler, R. Karp, D. Patterson, A. Sahay, K. S. an d E. Santos, R. Subramonian, and T. von Eicken. LogP: Towards a realistic model of parallel computation. In Proc. #th Symp. on Principles and Practice of# Parallel Programming, pages 1-12. ACM SIGPLAN, May 1993.

Digital Library

Google Scholar

[12]

F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable parallel computational geometry for coarse grained multicomputers. In Annual A CM Symposium on Computational Geometry, 1993.

Digital Library

Google Scholar

[13]

F. Dehne and S. GStz. Efficient Parallel Minimum Spanning Tree Algorithms for Coarse Grained Multicomputers and BSP. Manuscript, 1997.

Google Scholar

[14]

A. V. Gerbessiotis and C. J. Siniolakis. Deterministic sorting and randomized median finding on the BSP model. In Annual A CM Symposium on Parallel Algorithms and Architecture, 1996.

Digital Library

Google Scholar

[15]

A. V. Gerbessiotis and L. Valiant. Direct bulksynchronous parallel algorithms. Journal of Parallel and Distributed Computing, 22:251-267, 1994.

Digital Library

Google Scholar

[16]

P. B. Gibbons, Y. Matias, and V. Ramachandran. Can a shared-memory model serve as a bridging model for parallel computation? In Annual A CM Symposium on Parallel Algorithms and Architecture, 1997.

Digital Library

Google Scholar

[17]

M. T. Goodrich. Communication-efficient parallel sorting. In Proc. of the A CM Symposium on Theory of Computing, 1996.

Digital Library

Google Scholar

[18]

M. T. Goodrich. Randomized fully-scalable BSP techniques for multi-searching and convex hull construction. In A CM-SIAM Symposium on Discrete Algorithms, 1997.

Digital Library

Google Scholar

[19]

D. B. Johnson and P. Metaxas. A parallel algorithm for computing minimum spanning trees. Journal of Algorithms, 19:383-410, 1995.

Digital Library

Google Scholar

[20]

B. H. H. Juurlink and H. A. G. Wijshoff. Communication Primitives for BSP computers. Information Processing Letters, 58(6):303-310, 1996.

Digital Library

Google Scholar

[21]

D. Karger, P. Klein, and R. Tarjan. A Randomized Linear-Time Algorithm to find Minimum Spanning Trees. Journal of the A CM, 42:321-328, 1995.

Digital Library

Google Scholar

[22]

D. R. Karger. Random sampling for minimum spanning trees and other optimization problems. In Annual A CM Symposium on Foundations of Computer Science, 1993.

Google Scholar

[23]

V. King, C. Pooh, V. Ramachandran, and S. Sinha. An optimal EREW PRAM algorithm for minimum spanning tree verification. Information Processing Letters, 62(3):153-159, 1997.

Digital Library

Google Scholar

[24]

C. Pooh and V. Ramachandran. A randomized linear work EREW PRAM algorithm to find a minimum spanning forest. In International Symposium on Algorithms and Computation (ISAAC), LNCS 1350, pages 212-222, 1997.

Digital Library

Google Scholar

[25]

J. Reif, editor. Synthesis of parallel algorithms. Morgan Kaufmann Publishers, 1993.

Digital Library

Google Scholar

[26]

L. Valiant. A bridging model for parallel computation. Communications of the A CM, 33(8), Aug. 1990.

Digital Library

Google Scholar

[27]

A. Yao. Lower bounds by probabilistic arguments. In 24th IEEE Symposium on Foundations of Computer Science, pages 420-428, 1983.

Digital Library

Google Scholar

[28]

A. C. Yao. Some complexity questions related to distributive computing. In Proc. of the A CM Symposium on Theory of Computing, pages 209-213, 1979.

Digital Library

Google Scholar

Cited By

View all

Nanongkai DScquizzato M(2022)Equivalence classes and conditional hardness in massively parallel computationsDistributed Computing10.1007/s00446-021-00418-2Online publication date: 20-Jan-2022
https://doi.org/10.1007/s00446-021-00418-2
Gianinazzi LKalvoda PDe Palma ABesta MHoefler T(2018)Communication-avoiding parallel minimum cuts and connected componentsACM SIGPLAN Notices10.1145/3200691.317850453:1(219-232)Online publication date: 10-Feb-2018
https://dl.acm.org/doi/10.1145/3200691.3178504
Gianinazzi LKalvoda PDe Palma ABesta MHoefler TKrall AGross T(2018)Communication-avoiding parallel minimum cuts and connected componentsProceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming10.1145/3178487.3178504(219-232)Online publication date: 10-Feb-2018
https://dl.acm.org/doi/10.1145/3178487.3178504
Show More Cited By

Index Terms

Communication-optimal parallel minimum spanning tree algorithms (extended abstract)

Recommendations

Geometric Minimum Diameter Minimum Cost Spanning Tree Problem
ISAAC '09: Proceedings of the 20th International Symposium on Algorithms and Computation

In this paper we consider bi-criteria geometric optimization problems, in particular, the minimum diameter minimum cost spanning tree problem and the minimum radius minimum cost spanning tree problem for a set of points in the plane. The former problem ...
Parallel Algorithms for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains and the Heap-Traversal Technique
ICPPW '02: Proceedings of the 2002 International Conference on Parallel Processing Workshops

The Degree-Constrained Minimum Spanning Tree (d-MST) problem attempts to find a minimum spanning tree with an added constraint that no nodes in the tree have a degree larger than a specified integer d. It is known that computing the d-MST is NP-hard for ...
Degree-bounded minimum spanning tree for unit disk graph

Degree-bounded minimum spanning tree (DBMST) has been widely used in many applications of wireless sensor networks, such as data aggregation, topology control, etc. However, before construction of DBMST, it is NP-hard to determine whether or not there ...

Comments

Information & Contributors

Information

Published In

SPAA '98: Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures

June 1998

312 pages

ISBN:0897919890

DOI:10.1145/277651

Chairmen:
Gary Miller
Carnegie Mellon Univ., Pittsburgh, PA
,
Phillip B. Gibbons
Bell Labs

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1998

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SPAA/PODC98

Sponsor:

SPAA/PODC98: 10th Annual ACM Symposium on Parallel Algorithms and Architectures/Symposium on Principles of Distributed Computing

June 28 - July 2, 1998

Puerto Vallarta, Mexico

Acceptance Rates

SPAA '98 Paper Acceptance Rate 30 of 84 submissions, 36%;

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
762
Total Downloads

Downloads (Last 12 months)82
Downloads (Last 6 weeks)24

Reflects downloads up to 03 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Nanongkai DScquizzato M(2022)Equivalence classes and conditional hardness in massively parallel computationsDistributed Computing10.1007/s00446-021-00418-2Online publication date: 20-Jan-2022
https://doi.org/10.1007/s00446-021-00418-2
Gianinazzi LKalvoda PDe Palma ABesta MHoefler T(2018)Communication-avoiding parallel minimum cuts and connected componentsACM SIGPLAN Notices10.1145/3200691.317850453:1(219-232)Online publication date: 10-Feb-2018
https://dl.acm.org/doi/10.1145/3200691.3178504
Gianinazzi LKalvoda PDe Palma ABesta MHoefler TKrall AGross T(2018)Communication-avoiding parallel minimum cuts and connected componentsProceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming10.1145/3178487.3178504(219-232)Online publication date: 10-Feb-2018
https://dl.acm.org/doi/10.1145/3178487.3178504
Hegeman JPandurangan GPemmaraju SSardeshmukh VScquizzato MGeorgiou CSpirakis P(2015)Toward Optimal Bounds in the Congested CliqueProceedings of the 2015 ACM Symposium on Principles of Distributed Computing10.1145/2767386.2767434(91-100)Online publication date: 21-Jul-2015
https://dl.acm.org/doi/10.1145/2767386.2767434
Cong GTanase IXia Y(2015)Accelerating Minimum Spanning Forest Computations on Multicore PlatformsEuro-Par 2015: Parallel Processing Workshops10.1007/978-3-319-27308-2_44(541-552)Online publication date: 18-Dec-2015
https://doi.org/10.1007/978-3-319-27308-2_44
Cong GAlmasi GSaraswat VHess B(2010)Fast PGAS Implementation of Distributed Graph AlgorithmsProceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis10.1109/SC.2010.26(1-11)Online publication date: 13-Nov-2010
https://dl.acm.org/doi/10.1109/SC.2010.26
Lotker ZPavlov EPatt-Shamir BPeleg DRosenberg AMeyer auf der Heide F(2003)MST construction in O(log log n) communication roundsProceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures10.1145/777412.777428(94-100)Online publication date: 7-Jun-2003
https://dl.acm.org/doi/10.1145/777412.777428
Goldman AMounie GTrystram D(2003)1-optimality of static BSP computationsTheoretical Computer Science10.1016/S0304-3975(02)00039-7290:3(1331-1359)Online publication date: 3-Jan-2003
https://dl.acm.org/doi/10.1016/S0304-3975%2802%2900039-7
Dehne FGotz S(1998)Practical parallel algorithms for minimum spanning treesProceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281)10.1109/RELDIS.1998.740525(366-371)Online publication date: 1998
https://doi.org/10.1109/RELDIS.1998.740525

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Geometric Minimum Diameter Minimum Cost Spanning Tree Problem

Parallel Algorithms for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains and the Heap-Traversal Technique

Degree-bounded minimum spanning tree for unit disk graph