Graph coloring on a coarse grained multiprocessor: (Extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1928, Issue , 2000, Pages 184-195

  Gebremedhin, Assefaw Hadish ^a   Lassous, Isabelle Gufierin ^b   Gustedt, Jens ^c   Telle, Jan Arne ^a  

^a UNIVERSITY OF BERGEN   (Norway)

^b INRIA ROCQUENCOURT   (France)

^c LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MULTIPROCESSING SYSTEMS;

COARSE GRAINED MULTIPROCESSOR; EXTENDED ABSTRACTS; GRAPH COLORINGS; GRAPH G;

GRAPH THEORY;

EID: 23044524438     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40064-8_18     Document Type: Conference Paper

References (8)

1. J. R. Allwright, R. Bordawekar, P. D. Coddington, K. Dincer, and C. L. Martin. A comparison of parallel graph coloring algorithms. Technical Report SCCS-666, Northeast Parallel Architecture Center, Syracuse University, 1995.
2. D. Culler, R. Karp, D. Patterson, A. Sahay, K.E. Schauser, E. Santos, R. Subramo-nian, and T. von Eicken. LogP: Towards a Realistic Model of Parallel Computation. In Proceeding of 4-th ACM SIGPLAN Symp. on Principles and Practises of Parallel Programming, pages 1-12, 1993.
3. F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable parallel computational geome-try for coarse grained multicomputers. International Journal on Computational Geometry, 6(3):379-400, 1996.
4. Assefaw Hadish Gebremedhin and Fredrik Manne. Parallel graph coloring al-gorithms using OpenMP (extended abstract). In First European Workshop on OpenMP, pages 10-18, Lund, Sweden, September 30 - October 1, 1999.
5. Assefaw Hadish Gebremedhin and Fredrik Manne. Scalable, shared memory par-allel graph coloring heuristics. Technical Report 181, Department of Informatics, University of Bergen, 5020 Bergen, Norway, December 1999.
6. M. Goudreau, K. Lang, S. Rao, T. Suel, and T. Tsantilas. Towards eficiency and portability: Programming with the BSP model. In 8th Annual ACM symposium on Parallel Algorithms and Architectures (SPAA'96), pages 1-12, 1996.
7. Isabelle Gufierin Lassous, Jens Gustedt, and Michel Morvan. Feasability, portability, predictability and eficiency: Four ambitious goals for the design and implementation of parallel coarse grained graph algorithms. Technical report, INRIA, 2000.
8. Leslie G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, 1990.