Abstract
In this paper, we present CGMgraph, the first integrated library of parallel graph methods for PC clusters based on CGM algorithms. CGMgraph implements parallel methods for various graph problems. Our implementations of deterministic list ranking, Euler tour, connected components, spanning forest, and bipartite graph detection are, to our knowledge, the first efficient implementations for PC clusters. Our library also includes CGMlib, a library of basic CGM tools such as sorting, prefix sum, one to all broadcast, all to one gather, h-Relation, all to all broadcast, array balancing, and CGM partitioning. Both libraries are available for download at http://cgm.dehne.net.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bose, P., Chan, A., Dehne, F., Latzel, M.: Coarse Grained Parallel Maximum Matching in Convex Bipartite Graphs. In: 13th International Parallel Processing Symposium (IPPS 1999), pp. 125–129 (1999)
Cacere, E., Chan, A., Dehne, F., Prencipe, G.: Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs. In: Brandes, U., Wagner, D. (eds.) WG 2000. LNCS, vol. 1928, pp. 83–94. Springer, Heidelberg (2000)
Caceres, E., Chan, A., Dehne, F., Prencipe, G.: Coarse grained parallel algorithms for detecting convex bipartite graphs. In: Brandes, U., Wagner, D. (eds.) WG 2000. LNCS, vol. 1928, pp. 83–94. Springer, Heidelberg (2000)
Caceres, E., Chan, A., Dehne, F., Song, S.W.: Coarse Grained Parallel Graph Planarity Testing. In: International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2000), CSREA Press (2000)
Chan, A., Dehne, F.: A Note on Coarse Grained Parallel Integer Sorting. Parallel. Processing Letters 9(4), 533–538 (1999)
Dascal, S., Vishkin, U.: Experiments with List Ranking on Explicit Multi- Threaded (XMT) Instruction Parallelism. In: Vitter, J.S., Zaroliagis, C.D. (eds.) WAE 1999. LNCS, vol. 1668, p. 43. Springer, Heidelberg (1999)
Dehne, F.: Guest Editor’s Introduction, Special Issue on Coarse Grained Parallel Algorithms. Algorithmica 24(3/4), 173–176 (1999)
Dehne, F., Fabri, A., Rau-Chaplin, A.: Scalable Parallel Geometric Algorithms for Coarse Grained Multicomputers. In: ACM Symposium on Computational Geometry, pp. 298–307 (1993)
Dehne, F., Ferreira, A., Caceres, E., Song, S.W., Roncato, A.: Efficient Parallel Graph Algorithms for Coarse Grained Multicomputers and BSP. Algorithmica 33(2), 183–200 (2002)
Dehne, F., Song, S.W.: Randomized Parallel List Ranking for Distributed Memory Multiprocessors. In: Jaffar, J., Yap, R.H.C. (eds.) ASIAN 1996. LNCS, vol. 1179, pp. 1–10. Springer, Heidelberg (1996)
Hsu, T., Ramachandran, V., Dean, N.: Parallel Implementation of Algorithms for Finding Connected Components in Graphs. In: AMS/DIMACS Parallel Implementation Challenge Workshop III (1997)
Lassous, I.G., Gustedt, J., Morvan, M.: Feasability, Portability, Predictability and Efficiency: Four Ambitious Goals for the Design and Implementation of Parallel Coarse Grained Graph Algorithms. Technical Report RR-3885, INRIA, http://www.inria.fr/rrrt/rr-3885.html
LEDA library, http://www.algorithmic-solutions.com/
Reid-Miller, M.: List Ranking and List Scan on the Cray C-90. In: ACM Symposium on Parallel Algorithms and Architectures, pp. 104–113 (1994)
Reif, J. (ed.): Synthesis of Parallel Algorithms. Morgan and Kaufmatin Publishers, San Francisco (1993)
Shi, H., Schaeffer, J.: Parallel Sorting by Regular Sampling. Journal of Parallel and Distributed Computing 14, 361–372 (1992)
Sibeyn, J.F.: List Ranking on Meshes. Acta Informatica 35(7), 543–566 (1998)
Sibeyn, J.F., Guillaume, F., Seidel, T.: Practical Parallel List Ranking. Journal of Parallel and Distributed Computing 56(2), 156–180 (1999)
Valiant, L.: A Bridging Model for Parallel Computation. Communications of the ACM 33(8) (1990)
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
Chan, A., Dehne, F. (2003). CGMgraph/CGMlib: Implementing and Testing CGM Graph Algorithms on PC Clusters. In: Dongarra, J., Laforenza, D., Orlando, S. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 2003. Lecture Notes in Computer Science, vol 2840. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39924-7_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-39924-7_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20149-6
Online ISBN: 978-3-540-39924-7
eBook Packages: Springer Book Archive