Results 1 
2 of
2
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
A CoarseGrained Multicomputer Algorithm for the Longest Repeated Suffix Ending at Each Point in a Word
 11TH EUROMICRO CONFERENCE ON PARALLEL DISTRIBUTED AND NETWORK BASED PROCESSING (PDP'03)
, 2003
"... The paper presents a CoarseGrained Multicomputer algorithm that solves the problem of finding the longest repeated su#x ending at each point in a word. This algorithm can be implemented in the CGM with P processors in O( )intimeandO(P ) communication steps. It is the first CGM algorithm fo ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
The paper presents a CoarseGrained Multicomputer algorithm that solves the problem of finding the longest repeated su#x ending at each point in a word. This algorithm can be implemented in the CGM with P processors in O( )intimeandO(P ) communication steps. It is the first CGM algorithm for this problem. We present also experimental results showing that the CGM algorithm is very e#cient.