Results 1  10
of
764,619
A Coarse Grained Parallel Algorithm for Maximum Weight Matching in Trees
"... We present an efficient coarse grained parallel algorithm for computing a maximum weight matching in trees. A divide and conquer approach based on centroid decomposition of trees is used. Our algorithm requires O(log p) communication rounds with # # p O p and # # p O memory per processor (where ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We present an efficient coarse grained parallel algorithm for computing a maximum weight matching in trees. A divide and conquer approach based on centroid decomposition of trees is used. Our algorithm requires O(log p) communication rounds with # # p O p and # # p O memory per processor
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.
Efficient External Memory Algorithms by Simulating CoarseGrained Parallel Algorithms
"... External memory (EM) algorithms are designed for computational problems in which the size of the internal memory of the computer is only a small fraction of the problem size. For certain large scale applications this is necessarily true. Typiccdly, the cost models proposed for external memory algori ..."
Abstract
 Add to MetaCart
algorithms have measured only the number of 1/0 operations, and the algorithms have been specially crafted for the EM situation. In the past, several attempts have been made to relate the large body of work based on parallel algorithms to EM, but with limited success. In this paper we provide simulation
CoarseGrained Parallel Algorithms for MultiDimensional Wavelet Transforms
 The Journal of Supercomputing
, 1998
"... . This paper presents parallel algorithms for computing multidimensional wavelet transforms on both shared memory and distributed memory machines. Traditional data partitioning methods for ndimensional Discrete Wavelet Transforms (DWTs) call for data redistribution once a one dimensional wavelet t ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
. This paper presents parallel algorithms for computing multidimensional wavelet transforms on both shared memory and distributed memory machines. Traditional data partitioning methods for ndimensional Discrete Wavelet Transforms (DWTs) call for data redistribution once a one dimensional wavelet
A CoarseGrained Parallel Algorithm for Maximal Cliques in Circle Graphs
"... We present a parallel algorithm for generating the maximal cliques of a circle graph with n vertices and m edges. We consider the CoarseGrained Multicomputer Model (CGM) and show that the proposed algorithm requires O(log p) communication rounds, where p is the number of processors, independent of ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present a parallel algorithm for generating the maximal cliques of a circle graph with n vertices and m edges. We consider the CoarseGrained Multicomputer Model (CGM) and show that the proposed algorithm requires O(log p) communication rounds, where p is the number of processors, independent
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
Reducing i/o complexity by simulating coarse grained parallel algorithms
 In Proc. IPPS/SPDP
, 1999
"... Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully parallel disk I/O. In this paper we present a deterministic simulation technique which transforms parallel algorithms into ( ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
into (parallel) external memory algorithms. Specifically, we present a deterministic simulation technique which transforms Coarse Grained Multicomputer (CGM) algorithms into external memory algorithms for the Parallel Disk Model. Our technique optimizes blockwise data access and parallel disk I/O and
A Coarse Grained Parallel Algorithm for Hausdorff Voronoi Diagrams
"... Abstract — We present the first parallel algorithm for building a Hausdorff Voronoi diagram (HVD). Our algorithm is targeted towards cluster computing architectures and computes the Hausdorff Voronoi diagram for noncrossing objects in � � time for input � size � and processors. In addition, our pa ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract — We present the first parallel algorithm for building a Hausdorff Voronoi diagram (HVD). Our algorithm is targeted towards cluster computing architectures and computes the Hausdorff Voronoi diagram for noncrossing objects in � � time for input � size � and processors. In addition, our
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
"... Frank Dehne 2 Wolfgang Dittrich 3 David Hutchinson 2;4 Anil Maheshwari 2;4 July 30, 1998 Abstract Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully parallel disk I/ ..."
Abstract
 Add to MetaCart
/O. In this paper, we present a deterministic simulation technique which transforms Coarse Grained Multicomputer (CGM) algorithms into parallel external memory algorithms. It optimizes blockwise data access and parallel disk I/O and, at the same time, utilizes multiple processors connected via a communication
Results 1  10
of
764,619