Abstract
Matrix partitioning problems that arise in the efficient estimation of sparse Jacobians and Hessians can be modeled using variants of graph coloring problems. In a previous work [6], we argue that distance- 2 and distance- 3/2 graph coloring are robust and flexible formulations of the respective matrix estimation problems. The problem size in large-scale optimization contexts makes the matrix estimation phase an expensive part of the entire computation both in terms of execution time and memory space. Hence, there is a need for both shared- and distributed-memory parallel algorithms for the stated graph coloring problems. In the current work, we present the first practical shared address space parallel algorithms for these problems. The main idea in our algorithms is to randomly partition the vertex set equally among the available processors, let each processor speculatively color its vertices using information about already colored vertices, detect eventual conflicts in parallel, and finally re-color conflicting vertices sequentially. Randomization is also used in the coloring phases to further reduce conflicts. Our PRAM-analysis shows that the algorithms should give almost linear speedup for sparse graphs that are large relative to the number of processors. Experimental results from our OpenMP implementations on a Cray Origin2000 using various large graphs show that the algorithms indeed yield reasonable speedup for modest numbers of processors.
This author’s research was supported by NSF grant DMS-9807172, DOE ASCI level-2 subcontract B347882 from Lawrence Livermore National Lab; and by DOE SCI-DAC grant DE-FC02-01ER25476.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
T. F. Coleman and J. J. Moré. Estimation of sparse Jacobian matrices and graph coloring problems. SIAM J. Numer. Anal., 20(1):187–209, February 1983.
T. F. Coleman and J. J. Moré. Estimation of sparse Hessian matrices and graph coloring problems. Math. Program., 28:243–270, 1984.
T. F. Coleman and A. Verma. The efficient computation of sparse Jacobian matrices using automatic differentiation. SIAM J. Sci. Comput., 19(4):1210–1233, July 1998.
I. Finocchi, A. Panconesi, and R. Silvestri. Experimental analysis of simple, distributed vertex coloring algorithms. In Proceedings of the Thirteenth ACM-SIAM Symposium on Discrete Algorithms (SODA 02), San Francisco, CA, 2002.
A. H. Gebremedhin and F. Manne. Scalable parallel graph coloring algorithms. Concurrency: Pract. Exper., 12:1131–1146, 2000.
A. H. Gebremedhin, F. Manne, and A. Pothen. Graph coloring in optimization revisited. Technical Report 226, University of Bergen, Dept. of Informatics, Norway, January 2002. Available at: http://www.ii.uib.no/publikasjoner/texrap/.
R. Greenlaw, H. J. Hoover, and W. L. Ruzzo. Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, New York, 1995.
A.K.M.S. Hossain and T. Steihaug. Computing a sparse Jacobian matrix by rows and columns. Optimization Methods and Software, 10:33–48, 1998.
M. T. Jones and P. E. Plassmann. A parallel graph coloring heuristic. SIAM J. Sci. Comput., 14(3):654–669, May 1993.
S. O. Krumke, M. V. Marathe, and S. S. Ravi. Approximation algorithms for channel assignment in radio networks. In DIAL M for Mobility, Dallas, Texas, 1998.
S. T. McCormick. Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem. Math. Program., 26:153–171, 1983.
V. V. Vazirani. Approximation Algorithms. Springer, 2001. Chapter 5.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gebremedhin, A.H., Manne, F., Pothen, A. (2002). Parallel Distance-k Coloring Algorithms for Numerical Optimization. In: Monien, B., Feldmann, R. (eds) Euro-Par 2002 Parallel Processing. Euro-Par 2002. Lecture Notes in Computer Science, vol 2400. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45706-2_130
Download citation
DOI: https://doi.org/10.1007/3-540-45706-2_130
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44049-9
Online ISBN: 978-3-540-45706-0
eBook Packages: Springer Book Archive