Graph coloring on coarse grained multicomputers

Discrete Applied Mathematics

Volumn 131, Issue 1, 2003, Pages 179-198

  Gebremedhin, Assefaw Hadish ^a   Lassous, Isabelle Guérin ^b   Gustedt, Jens ^c   Telle, Jan Arne ^a  

^a UNIVERSITY OF BERGEN   (Norway)

^b INRIA ROCQUENCOURT   (France)

^c NONE

Author keywords

Coarse grained multicomputers; Graph algorithms; Graph coloring; Parallel algorithms

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

COARSE GRAINED COMPUTERS;

GRAPH THEORY;

EID: 0041861271     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00424-9     Document Type: Conference Paper

References (25)

1. J.R. Allwright, R. Bordawekar, P.D. Coddington, K. Dincer, C.L. Martin, A comparison of parallel graph coloring algorithms, Technical Report Technical Report SCCS-666, Northeast Parallel Architecture Center, Syracuse University, 1995.
2. Chaitin G., Auslander M., Chandra A., Cocke J., Hopkins M., Markstein P. Register allocation via coloring. Comput. Languages. 6:1981;47-57.
3. Chelbus B., Diks K., Rytter W., Szymacha T. Parallel complexity of lexicographically first problems for tree-structured graphs. Kreczmar A., Mirkowska G. Mathematical Foundations of Computer Science 1989, Proceedings 14th Symposium. Lecture Notes in Computer Science. Vol. 379:1989;185-195 Springer, Berlin.
4. Coleman T., Moré J. Estimation of sparse Jacobian matrices and graph coloring problems. SIAM J. Numer. Anal. 20(1):1983;187-209.
5. D. Culler, R. Karp, D. Patterson, A. Sahay, K. Schauser, E. Santos, R. Subramonian, T. von Eicken, LogP: towards a realistic model of parallel computation, in: Proceedings of the Fourth ACM SIGPLAN Symposium on Principles and Practises of Parallel Programming, San Diego, CA, 1993, pp. 1-12.
6. Dehne F., Fabri A., Rau-Chaplin A. Scalable parallel computational geometry for coarse grained multicomputers. Internat. J. Comput. Geom. 6(3):1996;379-400.
7. S. Fortune, J. Wyllie, Parallelism in random access machines, in: 10th ACM Symposium on Theory of Computing, San Diego, CA, 1978, pp. 114-118.
8. Gamst A. Some lower bounds for a class of frequency assignment problems. IEEE Trans. Vehicular Technol. 35(1):1986;8-14.
9. Garey M., Johnson D. Computers and Intractability. 1979;W.H. Freeman, New York.
10. Gebremedhin A.H., Manne F. Scalable parallel graph coloring algorithms. Concurrency: Practice and Experience. 12:2000;1131-1146.
11. M. Goudreau, K. Lang, S. Rao, T. Suel, T. Tsantilas, Towards efficiency and portability: programming with the BSP model, in: Eighth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'96), Padua, Italy, 1996, pp. 1-12.
12. Greenlaw R., Hoover H., Ruzzo W.L. Limits to Parallel Computation: P-Completeness Theory. 1995;Oxford University Press, New York.
13. I. Guérin Lassous, J. Gustedt, M. Morvan, Feasability, portability, predictability and efficiency: four ambitious goals for the design and implementation of parallel coarse grained graph algorithms, Technical Report 3885, INRIA, 2000a.
14. Guérin Lassous I., Gustedt J., Morvan M. Handling graphs according to a coarse grained approach: experiments with MPI and PVM. Dongarra J., Kacsuk P., Podhorszki N. Recent Advances in Parallel Virtual Machine and Message Passing Interface, Seventh European PVM/MPI Users' Group Meeting. Lectures Notes in Computer Science. Vol. 1908:2000b;72-79 Springer, Berlin.
15. Hajnal P., Szemerédi E. Brooks coloring in parallel. SIAM J. Discrete Math. 3(1):1990;74-80.
16. Jones M.T., Plassmann P.E. A parallel graph coloring heuristic. SIAM J. Scientific Comput. 14(3):1993;654-669.
17. Karchmer M., Naor J. A fast parallel algorithm to color a graph with D colors. J. Algorithms. 9(1):1988;83-91.
18. Karloff H.J. An NC algorithm for Brook's theorem. Theoret. Comput. Sci. 68(1):1989;89-103.
19. R. Karp, V. Ramachandran, Parallel algorithms for shared-memory machines, in: Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity, Elsevier, Amsterdam, 1990, pp. 869-942.
20. G. Lewandowski, Practical implementations and applications of graph coloring, Ph.D. Thesis, University of Wisconsin-Madison, 1994.
21. Luby M. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15(4):1986;1036-1053.
22. F. Manne, A parallel algorithm for computing the extremal eigenvalues of very large sparse matrices (extended abstract), in: Proceedings of Para98, Vol. 1541, Lecture Notes in Compouter Sciences, Springer, Berlin, 1998, pp. 332-336.
23. Naor J. A fast parallel coloring of planar graphs with five colors. Inform. Process. Lett. 25(1):1987;51-53.
24. Valiant L.G. A bridging model for parallel computation. Comm. ACM. 33(8):1990;103-111.
25. Vitter J.S., Simons R.A. New classes for parallel complexity. a study of unification and other complete problems for P IEEE Trans. Comput. C-35(5):1986;403-418.