Results 1 
7 of
7
Experiments with Parallel Graph Coloring Heuristics
 In (Johnson & Trick
, 1994
"... We report on experiments with a new hybrid graph coloring algorithm, which combines a parallel version of Morgenstern's SImpasse algorithm [20], with exhaustive search. We contribute new test data arising in five different application domains, including register allocation and class scheduling. We ..."
Abstract

Cited by 22 (0 self)
 Add to MetaCart
We report on experiments with a new hybrid graph coloring algorithm, which combines a parallel version of Morgenstern's SImpasse algorithm [20], with exhaustive search. We contribute new test data arising in five different application domains, including register allocation and class scheduling. We test our algorithms both on this test data and on several types of randomly generated graphs. We compare our parallel implementation, which is done on the CM5, with two simple heuristics, the Saturation algorithm of Br'elaz [4] and the Recursive Largest First (RLF) algorithm of Leighton [18]. We also compare our results with previous work reported by Morgenstern [20] and Johnson et al. [13]. Our main results are as follows. ffl On the randomly generated graphs, the performance of Hybrid is consistently better than the sequential algorithms, both in terms of speed and number of colorings produced. However, on large random graphs, our algorithms do not come close to the best colorings found ...
Scalable Parallel Graph Coloring Algorithms
, 2000
"... Finding a good graph coloring quickly is often a crucial phase in the development of efficient, parallel algorithms for many scientific and engineering applications. In this paper we consider the problem of solving the graph coloring problem itself in parallel. We present a simple and fast paral ..."
Abstract

Cited by 21 (7 self)
 Add to MetaCart
Finding a good graph coloring quickly is often a crucial phase in the development of efficient, parallel algorithms for many scientific and engineering applications. In this paper we consider the problem of solving the graph coloring problem itself in parallel. We present a simple and fast parallel graph coloring heuristic that is well suited for shared memory programming and yields an almost linear speedup on the PRAM model. We also present a second heuristic that improves on the number of colors used. The heuristics have been implemented using OpenMP. Experiments conducted on an SGI Cray Origin 2000 super computer using very large graphs from finite element methods and eigenvalue computations validate the theoretical runtime analysis.
Graph Coloring on Coarse Grained Multicomputers
, 2002
"... We present an efficient and scalable Coarse Grained Multicomputer (CGM) coloring algorithm that colors a graph G with at most D+ 1 colors where D is the maximum degree in G. This algorithm is given in two variants: randomized and deterministic. We show that on a pprocessor CGM model the proposed al ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We present an efficient and scalable Coarse Grained Multicomputer (CGM) coloring algorithm that colors a graph G with at most D+ 1 colors where D is the maximum degree in G. This algorithm is given in two variants: randomized and deterministic. We show that on a pprocessor CGM model the proposed algorithms require a parallel time of O( G p ) and a total work and overall communication cost of O(G). These bounds correspond to the average case for the randomized version and to the worstcase for the deterministic variant. Key words: graph algorithms, parallel algorithms, graph coloring, Coarse Grained Multicomputers 1
Parallel Graph Coloring Algorithms Using OpenMP (Extended Abstract)
 In First European Workshop on OpenMP
"... Assefaw Hadish Gebremedhin* Fredrik Manne i 1 ..."
New Integer Linear Programming Approaches for Course Timetabling
, 2006
"... (To be submitted to Computers and Operations Research) ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(To be submitted to Computers and Operations Research)
Scalable, Shared Memory Parallel Graph Coloring Heuristics
, 1999
"... Finding a good graph coloring quickly is often a crucial phase in the development of efficient, parallel algorithms for many scientific and engineering applications. In this paper we consider the problem of solving the graph coloring problem itself in parallel. We present a simple and fast paral ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Finding a good graph coloring quickly is often a crucial phase in the development of efficient, parallel algorithms for many scientific and engineering applications. In this paper we consider the problem of solving the graph coloring problem itself in parallel. We present a simple and fast parallel graph coloring heuristic that is well suited for shared memory programming and yields an almost linear speedup on the PRAM model. We also present a second heuristic that improves on the number of colors used. The heuristics have been implemented using OpenMP. Experiments conducted on an SGI Cray Origin 2000 using very large graphs from finite element methods and eigen value computations validate the theoretical runtime analysis. 1 Introduction The graph coloring problem (GCP) deals with assigning labels (called colors) to the vertices of a graph such that adjacent vertices do not get the same color. The primary objective is to minimize the number of colors used. The GCP arises i...
Scalable parallel graph coloring algorithms
"... Finding a good graph coloring quickly is often a crucial phase in the development of efficient, parallel algorithms for many scientific and engineering applications. In this paper we consider the problem of solving the graph coloring problem itself in parallel. We present a simple and fast parallel ..."
Abstract
 Add to MetaCart
Finding a good graph coloring quickly is often a crucial phase in the development of efficient, parallel algorithms for many scientific and engineering applications. In this paper we consider the problem of solving the graph coloring problem itself in parallel. We present a simple and fast parallel graph coloring heuristic that is well suited for shared memory programming and yields an almost linear speedup on the PRAM model. We also present a second heuristic that improves on the number of colors used. The heuristics have been implemented using OpenMP. Experiments conducted on an SGI Cray Origin 2000 supercomputer using very large graphs from finite element methods and eigenvalue computations validate the theoretical runtime analysis. Copyright © 2000 John Wiley & Sons, Ltd. KEY WORDS: graph coloring; parallel algorithms; shared memory programming; OpenMP 1.