Abstract
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributed-memory algorithm for doing the coloring itself in parallel. The algorithm operates in an iterative fashion; in each round vertices are speculatively colored based on limited information, and then a set of incorrectly colored vertices, to be recolored in the next round, is identified. Parallel speedup is achieved in part by reducing the frequency of communication among processors. Experimental results on a PC cluster using up to 16 processors show that the algorithm is scalable.
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
Allwright, J.R., Bordawekar, R., Coddington, P.D., Dincer, K., Martin, C.L.: A comparison of parallel graph coloring algorithms. Technical Report NPAC technical report SCCS-666, Northeast Parallel Architectures Center at Syracuse University (1994)
Bisseling, R.H.: Parallel Scientific Computation: A Structured Approach Using BSP and MPI. Oxford (2004)
Coleman, T.F., More, J.J.: Estimation of sparse jacobian matrices and graph coloring problems. SIAM J. Numer. Anal. 1(20), 187–209 (1983)
Crescenzi, P., Kann, V.: A compendium of NP optimization problems, http://www.nada.kth.se/~viggo/wwwcompendium/
Finocchi, I., Panconesi, A., Silvestri, R.: Experimental analysis of simple, distributed vertex coloring algorithms. In: Proc. 13th ACM-SIAMsymposium on Discrete Algorithms, SODA 2002 (2002)
Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, New York (1979)
Gebremedhin, A., Manne, F., Pothen, A.: Parallel distance-k coloring algorithms for numerical optimization. In: Monien, B., Feldmann, R.L. (eds.) Euro-Par 2002. LNCS, vol. 2400, pp. 912–921. Springer, Heidelberg (2002)
Gebremedhin, A.H., Manne, F.: Scalable parallel graph coloring algorithms. Concurrency: Practice and Experience 12, 1131–1146 (2000)
Gjertsen Jr., R.K., Jones, M.T., Plassmann, P.: Parallel heuristics for improved, balanced graph colorings. J. Par. and Dist. Comput. 37, 171–186 (1996)
Johansson, Ö.: Simple distributed δ + 1-coloring of graphs. Information Processing Letters 70, 229–232 (1999)
Jones, M.T., Plassmann, P.: A parallel graph coloring heuristic. SIAMJ. Sci. Comput. 14(3), 654–669 (1993)
Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1) (1999)
Strout, M.M., Hovland, P.D.: Metrics and models for reordering transformations. In: Proceedings of the The Second ACM SIGPLAN Workshop on Memory System Performance (MSP), June 8, pp. 23–34 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boman, E.G., Bozdağ, D., Catalyurek, U., Gebremedhin, A.H., Manne, F. (2005). A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers. In: Cunha, J.C., Medeiros, P.D. (eds) Euro-Par 2005 Parallel Processing. Euro-Par 2005. Lecture Notes in Computer Science, vol 3648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549468_29
Download citation
DOI: https://doi.org/10.1007/11549468_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28700-1
Online ISBN: 978-3-540-31925-2
eBook Packages: Computer ScienceComputer Science (R0)