874 search results - page 1 / 175 » Practical Algorithms for Selection on Coarse-Grained Paralle... |
IPPS
1996
IEEE
14 years 3 months ago
1996
IEEE
In this paper, we consider the problem of selection on coarse-grained distributed memory parallel computers. We discuss several deterministic and randomized algorithms for paralle...
EUROPAR
2004
Springer
14 years 4 months ago
2004
Springer
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 a...
ICPP
2005
IEEE
14 years 4 months ago
2005
IEEE
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
SC
2003
ACM
14 years 4 months ago
2003
ACM
The emergence of grid and a new class of data-driven applications is making a new form of parallelism desirable, which we refer to as coarse-grained pipelined parallelism. This pa...
IPPS
2007
IEEE
14 years 5 months ago
2007
IEEE
