Results 1  10
of
432
Efficient parallel graph algorithms for coarse grained multicomputers and BSP (Extended Abstract)
 in Proc. 24th International Colloquium on Automata, Languages and Programming (ICALP'97
, 1997
"... In this paper, we present deterministic parallel algorithms for the coarse grained multicomputer (CGM) and bulksynchronous parallel computer (BSP) models which solve the following well known graph problems: (1) list ranking, (2) Euler tour construction, (3) computing the connected components and s ..."
Abstract

Cited by 62 (22 self)
 Add to MetaCart
In this paper, we present deterministic parallel algorithms for the coarse grained multicomputer (CGM) and bulksynchronous parallel computer (BSP) models which solve the following well known graph problems: (1) list ranking, (2) Euler tour construction, (3) computing the connected components
Graph Coloring on Coarse Grained Multicomputers
"... We present an efficient and scalable Coarse Grained Multicomputer (CGM) coloring algorithm that colors a graph G with at most ∆+1 colors where ∆ is the maximum degree in G. This algorithm is given in two variants: a randomized and a deterministic. We show that on a pprocessor CGM model the proposed ..."
Abstract

Cited by 7 (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 ∆+1 colors where ∆ is the maximum degree in G. This algorithm is given in two variants: a randomized and a deterministic. We show that on a pprocessor CGM model
A Note on Parallel Selection on Coarse Grained Multicomputers
 Algorithmica
, 1999
"... Consider the selection problem of determining the kth smallest element of a set of n elements. Under the CGM (coarsegrained multicomputer) model with p processors and O(n=p) local memory, we present a deterministic parallel algorithm for the selection problem that requires O(log p) communication ro ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Consider the selection problem of determining the kth smallest element of a set of n elements. Under the CGM (coarsegrained multicomputer) model with p processors and O(n=p) local memory, we present a deterministic parallel algorithm for the selection problem that requires O(log p) communication
Scalable Coarse Grained Parallel Interval Graph Algorithms
 In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, Las Vegas (2000
, 2000
"... We present scalable coarse grained parallel algorithms for solving interval graph problems on a BSPlike modelCoarse Grained Multicomputers (CGM). The problems we consider include: finding maximum independent set, maximum weighted clique, minimum coloring and cut vertices and bridges. With scal ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We present scalable coarse grained parallel algorithms for solving interval graph problems on a BSPlike modelCoarse Grained Multicomputers (CGM). The problems we consider include: finding maximum independent set, maximum weighted clique, minimum coloring and cut vertices and bridges
Mapping Dynamic Programming Problems on Coarse Grained Multicomputer
"... Abstract—Parallelization of dynamic programming algorithms is a very well studied topic. In this paper we are interested by an important class of Dynamic Programming problems. Many results have been presented for this problems class for the fine grained parallel machines. We proposed an efficient ..."
Abstract
 Add to MetaCart
parallel CoarseGrained Multicomputer algorithm for a typical problem of this class. We present here the different possible execution scenarios of this algorithm and the implementation results of the most relevant one. I.
A Parallel Algorithm for Solving Tridiagonal Linear Systems on Coarse Grained Multicomputer
, 1997
"... The CGM (coarsegrained multicomputer) model has been proposed to be a model of parallelism sufficiently close to existing parallel machines. Despite its simplicity it intends to give a reasonable prediction of performance when parallel algorithms are implemented. Under the CGM model we design a com ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The CGM (coarsegrained multicomputer) model has been proposed to be a model of parallelism sufficiently close to existing parallel machines. Despite its simplicity it intends to give a reasonable prediction of performance when parallel algorithms are implemented. Under the CGM model we design a
A Randomized Parallel 3D Convex Hull Algorithm For Coarse Grained Multicomputers
 In Proc. ACM Symp. on Parallel Algorithms and Architectures
, 1995
"... We present a randomized parallel algorithm for constructing the 3D convex hull on a generic pprocessor coarse grained multicomputer with arbitrary interconection network and n=p local memory per processor, where n=p p 2+ffl (for some arbitrarily small ffl ? 0). For any given set of n points in ..."
Abstract

Cited by 50 (10 self)
 Add to MetaCart
We present a randomized parallel algorithm for constructing the 3D convex hull on a generic pprocessor coarse grained multicomputer with arbitrary interconection network and n=p local memory per processor, where n=p p 2+ffl (for some arbitrarily small ffl ? 0). For any given set of n points
Parallel Range Minima on Coarse Grained Multicomputers
, 1999
"... Given an array of n real numbers A = (a0 , a1 , ..., an 1 ), define MIN(i, j) = min{a i , ..., a j }. The range minima problem consists of preprocessing array A such that queries MIN(i, j), for any 0 i j n 1 can be answered in constant time. ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Given an array of n real numbers A = (a0 , a1 , ..., an 1 ), define MIN(i, j) = min{a i , ..., a j }. The range minima problem consists of preprocessing array A such that queries MIN(i, j), for any 0 i j n 1 can be answered in constant time.
Efficient parallel Text Retrieval techniques on Bulk Synchronous Parallel (BSP)/Coarse Grained
, 2008
"... Abstract In this paper, we present efficient, scalable, and portable parallel algorithms for the offline clustering, the online retrieval and the update phases of the Text Retrieval (TR) problem based on the vector space model and using clustering to organize and handle a dynamic document collect ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
collection. The algorithms are running on the CoarseGrained Multicomputer (CGM) and/or the Bulk Synchronous Parallel (BSP) model which are two models that capture within a few parameters the characteristics of the parallel machine. To the best of our knowledge, our parallel retrieval algorithms
Results 1  10
of
432