A framework for scalable greedy coloring on distributed-memory parallel computers

Journal of Parallel and Distributed Computing

Volumn 68, Issue 4, 2008, Pages 515-535

  Bozdaǧ, Doruk ^a   Gebremedhin, Assefaw H ^b   Manne, Fredrik ^c   Boman, Erik G ^d   Catalyurek, Umit V ^a,e  

^a Ohio State University   (United States)

^b ECS Building   (United States)

^c UNIVERSITY OF BERGEN   (Norway)

^d SANDIA NATIONAL LABORATORIES   (United States)

^e OHIO STATE UNIVERSITY   (United States)

Author keywords

Distributed memory computers; Experimental algorithmics; Graph coloring; Parallel algorithms; Scientific computing

Indexed keywords

DATA PROCESSING; GRAPH THEORY; NATURAL SCIENCES COMPUTING; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; SEQUENTIAL MACHINES;

DISTRIBUTED MEMORY COMPUTERS; EXPERIMENTAL ALGORITHMICS; GRAPH COLORING; PARALLEL DATA MANAGEMENT;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 39749131063     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2007.08.002     Document Type: Article

References (32)

1. J. Allwright, R. Bordawekar, P.D. Coddington, K. Dincer, C. Martin, A comparison of parallel graph coloring algorithms, Technical Report, NPAC Technical Report, SCCS-666, Northeast Parallel Architectures Center at Syracuse University, 1994.
2. Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti-Spaccamela A., and Protasi M. Complexity and Approximation (1999), Springer, Berlin
3. R.H. Bisseling, Parallel Scientific Computation: A Structured Approach Using BSP and MPI, Oxford, 2004.
4. Boman E.G., Bozdaǧ D., Catalyurek U., Gebremedhin A.H., and Manne F. A scalable parallel graph coloring algorithm for distributed memory computers. Proceedings of Euro-Par 2005, Lecture Notes in Computer Science vol. 3648 (2005), Springer, Berlin 241-251
5. Bozdaǧ D., Catalyurek U., Gebremedhin A.H., Manne F., Boman E.G., and Özgüner F. A parallel distance-2 graph coloring algorithm for distributed memory computers. Proceedings of HPCC 2005, Lecture Notes in Computer Science vol. 3726 (2005), Springer, Berlin 796-806
6. Coleman T.F., and More J.J. Estimation of sparse Jacobian matrices and graph coloring problems. SIAM J. Numer. Anal. 1 20 (1983) 187-209
7. Devine K., Boman E., Heaphy R., Hendrickson B., and Vaughan C. Zoltan data management services for parallel dynamic applications. Comput. Sci. Eng. 4 2 (2002) 90-97
8. Dolan E.D., and Moré J.J. Benchmarking optimization software with performance profiles. Math. Programming 91 2 (2002) 201-213
9. Finocchi I., Panconesi A., and Silvestri R. Experimental analysis of simple, distributed vertex coloring algorithms. Algorithmica 41 1 (2004) 1-23
10. Garey M.R., and Johnson D.S. Computers and Intractability (1979), Freeman, New York
11. Gebremedhin A.H., Guérin-Lassous I., Gustedt J., and Telle J.A. Graph coloring on coarse grained multicomputers. Discrete Appl. Math. 131 1 (2003) 179-198
12. Gebremedhin A.H., and Manne F. Scalable parallel graph coloring algorithms. Concurrency: Practice and Experience 12 (2000) 1131-1146
13. Gebremedhin A.H., Manne F., and Pothen A. Parallel distance-k coloring algorithms for numerical optimization. Proceedings of Euro-Par 2002, Lecture Notes in Computer Science vol. 2400 (2002), Springer, Berlin 912-921
14. Gebremedhin A.H., Manne F., and Pothen A. What color is your jacobian? Graph coloring for computing derivatives. SIAM Rev. 47 4 (2005) 629-705
15. Gebremedhin A.H., Manne F., and Woods T. Speeding up parallel graph coloring. Proceedings of Para 2004, Lecture Notes in Computer Science vol. 3732 (2005), Springer, Berlin 1079-1088
16. Genetic algorithms (evolutionary algorithms): repository of test problem generators 〈http://www.cs.uwyo.edu/∼wspears/generators.html〉.
17. Gjertsen Jr. R.K., Jones M.T., and Plassmann P. Parallel heuristics for improved, balanced graph colorings. J. Par. and Dist. Comput. 37 (1996) 171-186
18. Gtgraph: a suite of synthetic graph generators 〈http://www-static.cc.gatech.edu/∼kamesh/GTgraph/〉.
19. Johansson O. Simple distributed δ + 1-coloring of graphs. Inform. Process. Lett. 70 (1999) 229-232
20. Jones M., and Plassmann P. Scalable iterative solution of sparse linear systems. Parallel Comput. 20 5 (1994) 753-773
21. Jones M.T., and Plassmann P. A parallel graph coloring heuristic. SIAM J. Sci. Comput. 14 3 (1993) 654-669
22. G. Karypis, V. Kumar, A fast and high quality multilevel scheme for partitioning irregular graphs, SIAM J. Sci. Comput. 20(1).
23. Luby M. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15 4 (1986) 1036-1053
24. Manne F. A parallel algorithm for computing the extremal eigenvalues of very large sparse matrices. Proceedings of Para 1998, Lecture Notes in Computer Science vol. 1541 (1998), Springer, Berlin 332-336
25. Morgenstern C.A., and Shapiro H.D. Heuristics for rapidly four-coloring large planar graphs. Algorithmica 6 6 (1991) 869-891
26. Saad Y. ILUM: a multi-elimination ILU preconditioner for general sparse matrices. SIAM J. Sci. Comput. 17 (1996) 830-847
27. Strout M.M., Carter L., Ferrante J., Freeman J., and Kreaseck B. Combining performance aspects of irregular Gauss-Seidel via sparse tiling. In: Pugh W., and Tseng C.-W. (Eds). LCPC, Lecture Notes in Computer Science vol. 2481 (2002), Springer, Berlin 90-110
28. M.M. Strout, P.D. Hovland, Metrics and models for reordering transformations, in: Proceedings of the Second ACM SIGPLAN Workshop on Memory System Performance (MSP), 2004, pp. 23-34.
29. Test data from the Parasol project 〈http://www.parallab.uib.no/projects/parasol/data/〉.
30. The Second DIMACS Challenge 〈http://mat.gsia.cmu.edu/challenge.html〉.
31. University of Florida matrix collection 〈http://www.cise.ufl.edu/research/sparse/matrices/〉.
32. Valiant L. A bridging model for parallel computation. Comm. ACM 33 8 (1990) 103-111 bSP