Graph coloring algorithms for multi-core and massively multithreaded architectures

Parallel Computing

Volumn 38, Issue 10-11, 2012, Pages 576-594

  Çatalyürek, Ümit V ^a   Feo, John ^b   Gebremedhin, Assefaw H ^c   Halappanavar, Mahantesh ^b   Pothen, Alex ^c  

^a OHIO STATE UNIVERSITY   (United States)

^b PACIFIC NORTHWEST NATIONAL LABORATORY   (United States)

^c Purdue University   (United States)

Author keywords

Combinatorial scientific computing; Graph coloring; Multi core multithreaded computing; Parallel graph algorithms

Indexed keywords

ALGORITHM DESIGN; DATAFLOW; GRAPH COLORINGS; GRAPH PROBLEMS; HIGH PERFORMANCE ALGORITHMS; HIGH-PERFORMANCE COMPUTING; INPUT TYPE; IRREGULAR PROBLEMS; MANY-CORE ARCHITECTURE; MEMORY STRUCTURE; MULTI CORE; MULTI-CORE SYSTEMS; MULTI-THREADING CAPABILITIES; MULTITHREADED; MULTITHREADED ARCHITECTURE; NP-HARD; PARALLEL GRAPH ALGORITHMS; RUNTIME PERFORMANCE; SERIAL ALGORITHMS; SHARED MEMORIES; SHARED MEMORY SYSTEM; THREE SYSTEMS;

COMPUTER SOFTWARE SELECTION AND EVALUATION; GRAPH THEORY; HEURISTIC ALGORITHMS; MEMORY ARCHITECTURE; MICROPROCESSOR CHIPS;

ITERATIVE METHODS;

EID: 84866480007     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2012.07.001     Document Type: Article

References (35)

1. A. Lumsdaine, D. Gregor, B. Hendrickson, and J.W. Berry Challenges in parallel graph processing Parallel Processing Letters 17 1 2007 5 20
2. J. Kurzak, D.A. Bader, and J. Dongarra Scientific Computing with Multicore and Accelerators Computational Science Series 2011 Chapman and Hall CRC Press
3. D.A. Bader, and G. Cong Efficient graph algorithms for multicore and multiprocessors S. Rajasekaran, J. Reif, Handbook of Parallel Computing 2008 Chapman and Hall/CRC Press 1 44 (Chapter 26)
4. K. Madduri, D.A. Bader, J.W. Berry, J.R. Crobak, and B. Hendrickson Multithreaded algorithms for processing massive graphs D.A. Bader, Petascale Computing: Algorithms and Applications 2008 Chapman and Hall/CRC Press 237 258
5. M. Jones, and P. Plassmann Scalable iterative solution of sparse linear systems Parallel Computing 20 5 1994 753 773
6. Y. Saad ILUM: a multi-elimination ILU preconditioner for general sparse matrices SIAM Journal on Scientific Computing 17 1996 830 847
7. D. Hysom, and A. Pothen A scalable parallel algorithm for incomplete factor preconditioning SIAM Journal on Scientific Computing 22 2001 2194 2215
8. Z. DeVito, N. Joubert, F. Palacios, S. Oakley, M. Medina, M. Barrientos, E. Elsen, F. Ham, A. Aiken, K. Duraisamy, E. Darve, J. Alonso, and P. Hanrahan Liszt: a domain specific language for building portable mesh-based PDE solvers Supercomputing 3 2011 4
9. T.F. Coleman, and J.J. Moré Estimation of sparse Jacobian matrices and graph coloring problems SIAM Journal on Numerical Analysis 20 1 1983 187 209
10. T.F. Coleman, and J.J. Moré Estimation of sparse Hessian matrices and graph coloring problems Mathematical Programming 28 1984 243 270
11. A.H. Gebremedhin, F. Manne, and A. Pothen What color is your Jacobian? Graph coloring for computing derivatives SIAM Review 47 4 2005 629 705
12. D. Zuckerman Linear degree extractors and the inapproximability of max clique and chromatic number Theory of Computing 3 2007 103 128
13. A.H. Gebremedhin, D. Nguyen, M.M.A. Patwary, A. Pothen, ColPack: software for graph coloring and related problems in scientific computing, ACM Transactions on Methametical Software, submitted for publication.
14. D. Bozdag, A.H. Gebremedhin, F. Manne, E.G. Boman, and Ü.V. Çatalyürek A framework for scalable greedy coloring on distributed-memory parallel computers Journal of Parallel and Distributed Computing 68 4 2008 515 535
15. D. Bozdag, Ü.V. Çatalyürek, A.H. Gebremedhin, F. Manne, E.G. Boman, and F. Özgünner Distributed-memory parallel algorithms for distance-2 coloring and related problems in derivative computation SIAM Journal on Scientific Computing 32 4 2010 2418 2446
16. COLOR02/03/04: graph coloring and its generalizations. .
17. DIMACS implementation challenges.
18. J.S. Turner Almost all k-colorable graphs are easy to color Journal of Algorithms 9 1 1988 63 82
19. D. Brélaz New methods to color the vertices of a graph Communications of the ACM 22 4 1979 251 256
20. A. Coja-Oghlan, M. Krivelevich, and D. Vilenchik Why almost all k-colorable graphs are easy to color Theory of Computing Systems 46 2010 523 565
21. A.H. Gebremedhin, A. Tarafdar, F. Manne, and A. Pothen New acyclic and star coloring algorithms with application to computing Hessians SIAM Journal on Scientific Computing 29 2007 1042 1072
22. A.H. Gebremedhin, A. Pothen, A. Tarafdar, and A. Walther Efficient computation of sparse Hessians using coloring and automatic differentiation INFORMS Journal on Computing 21 2 2009 209 223
23. D. Molka, D. Hackenberg, R. Schone, and M.S. Muller Memory performance and cache coherency effects on an Intel Nehalem multiprocessor system Proceedings of the 2009 18th International Conference on Parallel Architectures and Compilation Techniques 2009 IEEE Computer Society Washington, DC, USA 261 270
24. M. Shah, J. Barren, J. Brooks, R. Golla, G. Grohoski, N. Gura, R. Hetherington, P. Jordan, M. Luttrell, C. Olson, B. Sana, D. Sheahan, L. Spracklen, and A. Wynn UltraSPARC T2: a highly-threaded, power-efficient SPARC SOC Solid-State Circuits Conference, 2007, ASSCC '07 2007 IEEE Asian 22 25
25. J. Feo, D. Harper, S. Kahan, P. Konecny, and Eldorado "Eldorado", Proceedings of the 2nd Conference on Computing Frontiers 2005 ACM New York, NY, USA 28 34
26. J. Nieplocha, A. Márquez, J. Feo, D. Chavarría-Miranda, G. Chin, C. Scherrer, and N. Beagley Evaluating the potential of multithreaded platforms for irregular scientific computations Proceedings of the 4th Conference on Computing Frontiers 2007 ACM New York, NY, USA 47 58
27. M. Luby A simple parallel algorithm for the maximal independent set problem SIAM Journal on Computing 15 4 1986 1036 1053
28. M.T. Jones, and P. Plassmann A parallel graph coloring heuristic SIAM Journal on Scientific Computing 14 3 1993 654 669
29. I. Finocchi, A. Panconesi, and R. Silvestri Experimental analysis of simple, distributed vertex coloring algorithms Algorithmica 41 1 2004 1 23
30. A.H. Gebremedhin, and F. Manne Scalable parallel graph coloring algorithms Concurrency: Practice and Experience 12 2000 1131 1146
31. D. Chakrabarti, and C. Faloutsos Graph mining: laws, generators, and algorithms ACM Computing Surveys 38 1 2006 2
32. D. Bader, J. Feo, J. Gilbert, J. Kepner, D. Keoster, E. Loh, K. Madduri, B. Mann, T. Meuse, HPCS scalable synthetic compact applications 2, 2007.
33. D.J. Watts, and S.H. Strogatz Collective dynamics of small-world networks Nature 393 6684 1998 440 442
34. P.R. Amestoy, T.A. Davis, and I.S. Duff An approximate minimum degree ordering algorithm SIAM Journal on Matrix Analysis and Applications 17 4 1996 886 905
35. K.J. Barker, K. Davis, A. Hoisie, D.J. Kerbyson, M. Lang, S. Pakin, and J.C. Sancho A performance evaluation of the Nehalem quad-core processor for scientific computing Parallel Processing Letters 18 4 2008 453 469