cgmGRAPH / cgmLIB
A Library For Coarse-Grained Parallel Computing
CGMgraph is the first integrated library of parallel graph methods for PC clusters based on Coarse Grained Multicomputer (CGM) algorithms. CGM-graph 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.
- A.Chan, F.Dehne, and R.Taylor, "Implementing and testing cgm graph algorithms on pc clusters and shared memory machines", Int. Journal of High Performance Computing Applications, vol.19, no.1, pp.81-97, 2005. [pdf]
- A.Chan and F.Dehne, "CGMgraph/CGMlib: Implementing and testing CGM graph algorithms on PC clusters", in Proc. 10th EuroPVM/MPI, pp.117-125, Springer LNCS 2840, 2003. [pdf]