Results 1  10
of
467
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
CoarseGrained Parallel Geometric Search
 Journal of Parallel and Distributed Computing
, 1999
"... This paper improves on op. cit. in several ways: (1) It studies the more general next element search problem which also solves, e.g., planar point location. (2) The algorithms require only O((n#p) log n) local computation instead of O(log p*(n#p) log n). (3) The algorithms require only O((n#p) l ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
This paper improves on op. cit. in several ways: (1) It studies the more general next element search problem which also solves, e.g., planar point location. (2) The algorithms require only O((n#p) log n) local computation instead of O(log p*(n#p) log n). (3) The algorithms require only O
Efficient External Memory Algorithms by Simulating CoarseGrained Parallel Algorithms
, 2003
"... External memory (EM) algorithms are designed for largescale computational problems in which the size of the internal memory of the computer is only a small fraction of the problem size. Typical EM algorithms are specially crafted for the EM situation. In the past, several attempts have been made to ..."
Abstract

Cited by 46 (11 self)
 Add to MetaCart
to relate the large body of work on parallel algorithms to EM, but with limited success. The combination of EM computing, on multiple disks, with multiprocessor parallelism has been posted as a challenge by the ACMWorking Group on Storage I/O for LargeScale Computing.
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
CoarseGrained Parallel Computing on Heterogeneous Systems
, 1998
"... We consider the problem of finding efficient parallel algorithms for heterogeneous parallel computers, i.e., parallel computers in which different processors have different computational potential. To this end, we define a formal computational model for heterogeneous systems and develop algorithm ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We consider the problem of finding efficient parallel algorithms for heterogeneous parallel computers, i.e., parallel computers in which different processors have different computational potential. To this end, we define a formal computational model for heterogeneous systems and develop
A CoarseGrained Parallel Algorithm for Spanning Tree and Connected Components
, 2003
"... Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM algorithm for computing a spanning tree and the connected components of a graph, that requires O(log p) communication ..."
Abstract
 Add to MetaCart
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM algorithm for computing a spanning tree and the connected components of a graph, that requires O(log p
A Randomized Parallel ThreeDimensional Convex Hull Algorithm for CoarseGrained Multicomputers
, 1997
"... We present a randomized parallel algorithm for constructing the threedimensional convex hull on a generic pprocessor coarsegrained multicomputer with arbitrary interconnection network and n/p local memory per processor, where (for some arbitrarily small #>0). For any given set of n points i ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present a randomized parallel algorithm for constructing the threedimensional convex hull on a generic pprocessor coarsegrained multicomputer with arbitrary interconnection network and n/p local memory per processor, where (for some arbitrarily small #>0). For any given set of n points
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
A load balancing technique for some coarsegrained multicomputer algorithms
 IN SCA 21ST INTERNATIONAL CONFERENCE ON COMPUTERS AND THEIR APPLICATIONS (CATA06)
, 2006
"... The paper presents a load balancing method for some CGM (CoarseGrained Multicomputer) algorithms. This method can be applied on different dynamic programming problems such as: Longest Increasing Subsequence, Longest Common Subsequence, Longest Repeated Suffix Ending at each point in a word and Dete ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The paper presents a load balancing method for some CGM (CoarseGrained Multicomputer) algorithms. This method can be applied on different dynamic programming problems such as: Longest Increasing Subsequence, Longest Common Subsequence, Longest Repeated Suffix Ending at each point in a word
Results 1  10
of
467