Distributed-memory parallel algorithms for distance-2 coloring and related problems in derivative computation

SIAM Journal on Scientific Computing

Volumn 32, Issue 4, 2010, Pages 2418-2446

  Bozdaǧ, Doruk ^a   Çatalyürek, Ümit V ^a   Gebremedhin, Assefaw H ^b   Manne, Fredrik ^c   Boman, Erik G ^d   Özgüner, Füsun ^e  

^a OHIO STATE UNIVERSITY   (United States)

^b Purdue University   (United States)

^c UNIVERSITY OF BERGEN   (Norway)

^d SANDIA NATIONAL LABORATORIES   (United States)

^e Ohio State University   (United States)

Author keywords

Automatic differentiation; Combinatorial scientific computing; Distance 2 graph coloring; Distributed memory parallel algorithms; Hessian computation; Jacobian computation; Sparsity exploitation

Indexed keywords

CLUSTERING ALGORITHMS; COLORING; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL EFFICIENCY; GRAPH THEORY; HEURISTIC ALGORITHMS; ITERATIVE METHODS; MEMORY ARCHITECTURE; OPTIMIZATION;

AUTOMATIC DIFFERENTIATIONS; COMBINATORIAL SCIENTIFIC COMPUTING; DISTANCE-2 GRAPH COLORING; DISTRIBUTED MEMORY; DISTRIBUTED-MEMORY PARALLEL ALGORITHM; GRAPH COLORINGS; HESSIAN COMPUTATION; JACOBIAN COMPUTATION; JACOBIANS; SPARSITY EXPLOITATIONS;

PARALLEL ALGORITHMS;

EID: 77955693754     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/080732158     Document Type: Article

References (31)

1. G. AGNARSSON, R. GREENLAW, AND M. M. HALLDóRSSON, On powers of chordal graphs and their colorings, Congr. Numer., 100 (2000), pp. 41-65.
2. G. AGNARSSON AND M. M. HALLDóRSSON, Coloring powers of planar graphs, SIAM J. Discrete Math., 16 (2003), pp. 651-662.
3. P. R. AMESTOY, I. S. DUFF, J.-Y. L'EXCELLENT, AND J. KOSTER, A fully asynchronous multifrontal solver using distributed dynamic scheduling, SIAM J. Matrix Anal. Appl., 23 (2001), pp. 15-41.
4. R. H. BISSELING, Parallel Scientific Computation: A Structured Approach Using BSP and MPI, Oxford University Press, London, 2004.
5. D. BOZDAǦ, U. CATALYUREK, A. H. GEBREMEDHIN, F. MANNE, E. G. BOMAN, AND F. öZGüNER, A parallel distance-2 graph coloring algorithm for distributed memory computers, in Proceedings of HPCC 2005, Lecture Notes in Comput. Sci. 3726, Springer, New York, 2005, pp. 796-806.
6. D. BOZDAǦ, A. H. GEBREMEDHIN, F. MANNE, E. G. BOMAN, AND U. V. CATALYUREK, A framework for scalable greedy coloring on distributed-memory parallel computers, J. Parallel Distrib. Comput., 68 (2008), pp. 515-535.
7. U. V. CATALYUREK AND C. AYKANAT, Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication, IEEE Trans. Parallel Distrib. System, 10 (1999), pp. 673-693.
8. T. F. COLEMAN AND J. J. MORé, Estimation of sparse Jacobian matrices and graph coloring problems, SIAM J. Numer. Anal., 20 (1983), pp. 187-209.
9. T. F. COLEMAN AND J. J. MORé, Estimation of sparse Hessian matrices and graph coloring problems, Math. Program., 28 (1984), pp. 243-270.
10. A. R. CURTIS, M. J. D. POWELL, AND J. K. REID, On the estimation of sparse Jacobian matrices, J. Inst. Math. Appl., 13 (1974), pp. 117-119.
11. T. DAVIS AND Y. HU, maintainers, University of Florida Sparse Matrix Collection, available at http://www.cise.ufl.edu/research/sparse/matrices/.
12. K. DEVINE, E. BOMAN, R. HEAPHY, B. HENDRICKSON, AND C. VAUGHAN, Zoltan data management services for parallel dynamic applications, Comput. Sci. Engrg., 4 (2002), pp. 90-97.
13. A. H. GEBREMEDHIN, A. POTHEN, A. TARAFDAR, AND A. WALTHER, Efficient computation of sparse Hessians using coloring and automatic differentiation, INFORMS J. Comput., 21 (2009), pp. 209-223.
14. A. H. GEBREMEDHIN AND F. MANNE, Scalable parallel graph coloring algorithms, Concurrency: Practice and Experience, 12 (2000), pp. 1131-1146.
15. A. H. GEBREMEDHIN, F. MANNE, AND A. POTHEN, Parallel distance-k coloring algorithms for numerical optimization, in Proceedings of Euro-Par 2002, Lecture Notes in Comput. Sci. 2400, Springer, New York, 2002, pp. 912-921.
16. A. H. GEBREMEDHIN, F. MANNE, AND A. POTHEN, What color is your Jacobian? Graph coloring for computing derivatives, SIAM Rev., 47 (2005), pp. 629-705.
17. A. H. GEBREMEDHIN, A. TARAFDAR, F. MANNE, AND A. POTHEN, New acyclic and star coloring algorithms with application to computing Hessians, SIAM J. Sci. Comput., 29 (2007), pp. 1042-1072.
18. D. HYSOM AND A. POTHEN, A scalable parallel algorithm for incomplete factor preconditioning, SIAM J. Sci. Comput., 22 (2001), pp. 2194-2215.
19. M. T. JONES AND P. E. PLASSMANN, Scalable iterative solution of sparse linear systems, Parallel Comput., 20 (1994), pp. 753-773.
20. G. KARYPIS AND V. KUMAR, A fast and high quality multilevel scheme for partitioning irregular graphs, SIAM J. Sci. Comput., 20 (1998), pp. 359-392. (Pubitemid 128689516)
21. S. O. KRUMKE, M. V. MARATHE, AND S. S. RAVI, Models and approximation algorithms for channel assignment in radio networks, Wireless Networks, 7 (2001), pp. 575-584.
22. V. S. A. KUMAR, M. V. MARATHE, S. PARTHASARATHY, AND A. SRINIVASAN, End-to-end packetscheduling in wireless ad-hoc networks, in Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, 2004, SIAM, Philadelphia, pp. 1014-1023.
23. S. T. MCCORMICK, Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem, Math. Program., 26 (1983), pp. 153-171.
24. C. A. MORGENSTERN AND H. D. SHAPIRO, Heuristics for rapidly four-coloring large planar graphs, Algorithmica, 6 (1991), pp. 869-891.
25. M. E. J. NEWMAN, The structure and function of complex networks, SIAM Rev., 45 (2003), pp. 167-256.
26. M. J. D. POWELL AND PH. L. TOINT, On the estimation of sparse Hessian matrices, SIAM J. Numer. Anal., 16 (1979), pp. 1060-1074.
27. Y. SAAD, ILUM: A multi-elimination ILU preconditioner for general sparse matrices, SIAM J. Sci. Comput., 17 (1996), pp. 830-847.
28. M. M. STROUT AND P. D. HOVLAND, Metrics and models for reordering transformations, in Proceedings of the Second ACM SIGPLAN Workshop on Memory System Performance, 2004, ACM, New York, pp. 23-34.
29. The Second DIMACS Implementation Challenge: Maximum Clique, Graph Coloring, and Satisfiability, http://dimacs.rutgers.edu/Challenges.
30. GEORGIA TECH COLLEGE OF COMPUTING, GTgraph: A suite of synthetic graph generators, available at http://www-static.cc.gatech.edu/-kamesh/GTgraph/.
31. THE ZOLTAN TEAM, Zoltan: Parallel partitioning, load balancing and data-management services, software package available online at http://www.cs.sandia.gov/Zoltan/.