Randomized Algorithms on the Mesh

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.

• Type: Conference
• Year: 1998
• Where: IPPS
• Authors: Lata Narayanan
• Keywords: Distributed And Parallel Computing, IPPS 1998, Mesh Topology, Parallel Computation, Parallel Machines