Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

IPPS
1998
IEEE

favoriteEmaildiscussreport

107views Distributed And Parallel Com...» more IPPS 1998»

Randomized Algorithms on the Mesh

13 years 8 months ago

Randomized Algorithms on the Mesh

Download ipdps.cc.gatech.edu

The mesh-connected array is an attractive architecture for parallel machines, and a number of existing parallel machines are based on a mesh topology. In this paper, we survey the results on three fundamental problems in parallel computation: routing, sorting, and selection, and demonstrate that randomized algorithms for these problems on the mesh are often the most natural and e cient algorithms available.

Lata Narayanan

Real-time Traffic

Distributed And Parallel Computing | IPPS 1998 | Mesh Topology | Parallel Computation | Parallel Machines |

claim paper

Related Content

» A Stream Algorithm for the Decimation of Massive Meshes

» Two Algorithms for Fast Reclustering of Dynamic Meshed Surfaces

» Better Deterministic Routing on Meshes

» Fast mesh segmentation using random walks

» Optimal randomized algorithms for multipacket and cut through routing on the mesh

» Using Intelligent Agents to Build Navigation Meshes

» Watermarking 3D Polygonal Meshes in the Mesh Spectral Domain

» Randomized PartiallyMinimal Routing on ThreeDimensional Mesh Networks

» Interactive Mesh Cutting Using Constrained Random Walks

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1998
Where	IPPS
Authors	Lata Narayanan

Comments (0)