Efficient scalable mesh algorithms for merging, sorting and selection

Authors:
S. Ramnath
Affiliations:
-
Venue:
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Year:
1995

Citing 6
Cited 0

Array processor with multiple broadcasting

Journal of Parallel and Distributed Computing
Optimal bounds for decision problems on the CRCW PRAM

Journal of the ACM (JACM)
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Efficient median finding and its application to two-variable linear programming on mesh-connected computers with multiple broadcasting

Journal of Parallel and Distributed Computing
Sorting on a mesh-connected parallel computer

Communications of the ACM
Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing, Sorting, and Selection

ESA '93 Proceedings of the First Annual European Symposium on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficient scalable algorithms are developed for a mesh with fixed buses. The problems considered are merging, sorting and selection. The size of the input is fixed at n, and the mesh size is varied from /spl radic/n/spl times//spl radic/n to n/spl times/n. The merging algorithm is optimal for all the mesh sizes, whereas the sorting and selection algorithms are within factors of i/(1-/spl epsiv/) and log/sup 4/3/ n respectively, of the optimal.