Practical Algorithms for Selection on Coarse-Grained Parallel Computers

14 years 3 months ago

Download ipdps.cc.gatech.edu

In this paper, we consider the problem of selection on coarse-grained distributed memory parallel computers. We discuss several deterministic and randomized algorithms for parallel selection. Experimental results on the CM5 demonstrate that randomized algorithms are superior to their deterministic counterparts.

Ibraheem Al-Furaih, Srinivas Aluru, Sanjay Goil, S

Real-time Traffic

Coarse-grained Distributed Memory | Distributed And Parallel Computing | IPPS 1996 | Parallel Selection | Randomized Algorithms |

claim paper

» Filter Decomposition for Supporting CoarseGrained Pipelined Parallelism

» Compiler Support for Exploiting CoarseGrained Pipelined Parallelism

» A Modulo Scheduling Algorithm for a CoarseGrain Reconfigurable Array Template

» A Range Minima Parallel Algorithm for Coarse Grained Multicomputers

» CoarseGrained Distributed Parallel Programming Interface for Grid Computing

» Vector Prefix and Reduction Computation on CoarseGrained DistributedMemory Parallel Machin...

» Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs

» A Coarse Grained Parallel Algorithm for Hausdorff Voronoi Diagrams

Post Info
More Details (n/a)

Added	07 Aug 2010
Updated	07 Aug 2010
Type	Conference
Year	1996
Where	IPPS
Authors	Ibraheem Al-Furaih, Srinivas Aluru, Sanjay Goil, Sanjay Ranka

Comments (0)

Sciweavers

Practical Algorithms for Selection on Coarse-Grained Parallel Computers

Coarse-grained Distributed Memory | Distributed And Parallel Computing | IPPS 1996 | Parallel Selection | Randomized Algorithms |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers