A scalable parallel graph coloring algorithm for distributed memory computers

Lecture Notes in Computer Science

Volumn 3648, Issue , 2005, Pages 241-251

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

^a SANDIA NATIONAL LABORATORIES   (United States)

^b OHIO STATE UNIVERSITY   (United States)

^c OLD DOMINION UNIVERSITY   (United States)

^d UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COLOR; DATA STORAGE EQUIPMENT; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; ITERATIVE METHODS; PROGRAM PROCESSORS;

COMPUTATIONAL TASKS; DISTRIBUTED MEMORY; GRAPH COLORING; PARALLEL APPLICATIONS;

PARALLEL PROCESSING SYSTEMS;

EID: 27144506674     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11549468_29     Document Type: Conference Paper

References (13)

1. J.R. Allwright, R. Bordawekar, P. D. Coddington, K. Dincer, and C.L. Martin. A comparison of parallel graph coloring algorithms. Technical Report NPAC technical report SCCS-666, Northeast Parallel Architectures Center at Syracuse University, 1994.
2. Rob H. Bisseling. Parallel Scientific Computation: A Structured Approach Using BSP and MPI. Oxford, 2004.
3. T. F. Coleman and J. J More. Estimation of sparse jacobian matrices and graph coloring problems. SIAM J. Numer. Anal., 1(20):187-209, 1983.
4. Pierluigi Crescenzi and Viggo Kann. A compendium of NP optimization problems. http://www.nada.kth.se/~viggo/wwwcompendium/.
5. Irene Finocchi, Alessandro Panconesi, and Riccardo Silvestri. Experimental analysis of simple, distributed vertex coloring algorithms. In Proc. 13th ACM-SIAM symposium on Discrete Algorithms (SODA 02), 2002.
6. M. R. Garey and D. S. Johnson. Computers and Intractability. Freeman, 1979.
7. Assefaw Gebremedhin, Fredrik Manne, and Alex Pothen. Parallel distance-k coloring algorithms for numerical optimization. In proceedings of Euro-Par 2002, volume 2400, pages 912-921. Lecture Notes in Computer Science, Springer, 2002.
8. Assefaw Hadish Gebremedhin and Fredrik Manne. Scalable parallel graph coloring algorithms. Concurrency: Practice and Experience, 12:1131-1146, 2000.
9. Robert K. Gjertsen Jr., Mark T. Jones, and Paul Plassmann. Parallel heuristics for improved, balanced graph colorings. J. Par. and Dist. Comput., 37:171-186, 1996.
10. Öjvind Johansson. Simple distributed δ + 1-coloring of graphs. Information Processing Letters, 70:229-232, 1999.
11. Mark T. Jones and Paul Plassmann. A parallel graph coloring heuristic. SIAM J. Sci. Comput., 14(3):654-669, 1993.
12. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput., 20(1), 1999.
13. Michelle Mills Strout and Paul D. Hovland. Metrics and models for reordering transformations. In Proceedings of the The Second ACM SIGPLAN Workshop on Memory System Performance (MSP), pages 23-34, June 8 2004.