CGMGRAPH/CGMLIB: Implementing and testing CGM graph algorithms on PC clusters and shared memory machines

International Journal of High Performance Computing Applications

Volumn 19, Issue 1, 2005, Pages 81-97

  Chan, Albert ^a   Dehne, Frank ^b   Taylor, Ryan ^c  

^a FAYETTEVILLE STATE UNIVERSITY   (United States)

^b GRIFFITH UNIVERSITY   (Australia)

^c CARLETON UNIVERSITY   (Canada)

Author keywords

Coarse grained multiprocessor; Graph algorithms; Library; Parallel algorithms implementation; Processor cluster

Indexed keywords

COMPUTER WORKSTATIONS; DATA STORAGE EQUIPMENT; PARALLEL ALGORITHMS; PERFORMANCE; PERSONAL COMPUTERS; TESTING;

COARSE GRAINED MULTIPROCESSOR; COARSE GRAINED MULTIPROCESSOR LIBRARY; GRAPH ALGORITHMS; PARALLEL ALGORITHMS IMPLEMENTATION; PROCESSOR CLUSTER;

PARALLEL PROCESSING SYSTEMS;

EID: 14744296887     PISSN: 10943420     EISSN: None     Source Type: Journal    
DOI: 10.1177/1094342005051196     Document Type: Article

References (16)

1. Caceres, E., Chan, A., Dehne, F., and Prencipe, G. 2000. Coarse grained parallel algorithms for detecting convex bipartite graphs. Proceedings of the 26th Workshop on Graph-Theoretic Concepts in Computer Science (WG 2000), Lecture Notes in Computer Science Vol. 1928, Springer-Verlag, Berlin, pp. 83-94.
2. Chan, A. and Dehne, F. 1998. A note on coarse grained parallel integer sorting. Technical Report TR-98-06, School of Computer Science, Carleton University. Available at http://www.scs.carleton.ca/.
3. Chan, A. and Dehne, F. 1999. A note on coarse grained parallel integer sorting. Parallel Processing Letters 9(4):533-538.
4. Chan, A. and Dehne, F. 2003. CGMgraph/CGMlib: implementing and Testing CGM Graph Algorithms on P Clusters. Proceedings of the 10th European PVM/MPI Users Group Meeting (Euro PVM/MPI03), Lecture Notes in Computer Science Vol. 2840, Springer-Verlag, Berlin, pp. 117-125.
5. Dehne, F., Ferreira, A., Caceres, E., Song, S.W., and Roncato, A. 2002. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. Algorithmica 33(2):183-200.
6. Dehne, F. and Song, S.W. 1996. Randomized parallel list ranking for distributed memory multiprocessors. Asian Computer Science Conference (ASIAN '96), Lecture Notes in Computer Science Vol. 1179, Springer-Verlag, Berlin, pp. 1-10.
7. Dehne, F., Fabri, A., and Rau-Chaplin, A. 1993. Scalable parallel geometric algorithms for coarse grained multicomputers. ACM Symposium on Computational Geometry, San Diego, CA, May, pp. 298-307.
8. Goodrich, M.T. 1996. Communication efficient parallel sorting. Proceedings of the 28th Annual ACM Symposium on Theory of Computing, Philadelphia, PA, May.
9. Guerin Lassous, I., Gustedt, J., and Morvan, M. 2000. 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).
10. Reid-Miller, M. 1994. List Ranking and List Scan on the Cray C-90. ACM Symposium on Parallel Algorithms and Architectures, Cape May, NJ, June, pp. 104-113.
11. Reif, J. 1993. Synthesis of Parallel Algorithms, Morgan Kaufmann Publishers, San Mateo, CA.
12. Shi, H. and Schaeffer, J. 1992. Parallel sorting by regular sampling. Journal of Parallel and Distributed Computing 14:361-372.
13. Sibeyn, J.F. 1998. List ranking on meshes. Acta Informatica 35(7):543-566.
14. Sibeyn, J.F., Guillaume, E, and Seidel, T. 1999. Practical parallel list ranking. Journal of Parallel and Distributed Computing 56(2): 156-180.
15. Thakur, R., Rabenseifner, R., and Gropp, W. 2005. Optimization of collective communication operations in MPICH. High Performance Computing Applications 19(1):49-66.
16. Valiant, L. 1990. A Bridging Model for Parallel computation. Communications of the ACM 33(8).