Sorting n2 Numbers on n x n Meshes

Authors:
Madhusudan Nigam;Sartaj Sahni
Affiliations:
-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1995

Citing 6
Cited 2

An optimal sorting algorithm for mesh connected computers

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Tight bounds on the complexity of parallel sorting

IEEE Transactions on Computers
Two nearly optimal sorting algorithms for mesh-connected processor arrays using shear-sort

Journal of Parallel and Distributed Computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Improved sorting algorithms for parallel computers

CSC '87 Proceedings of the 15th annual conference on Computer Science
Sorting on a mesh-connected parallel computer

Communications of the ACM

Optimal Sorting Algorithms on Incomplete Meshes with Arbitrary Fault Patterns

ICPP '97 Proceedings of the international Conference on Parallel Processing
The Robust-Algorithm Approach to Fault Tolerance on Processor Arrays: Fault Models, Fault Diameter, and Basic Algorithms

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that by folding data from an n脳n mesh onto an n脳 (n/k) submesh, sorting on the submesh, and finally unfolding back onto the entire n脳n mesh it is possible to sort on bidirectional and strict unidirectional meshes using a number of routing steps that is very close to the distance lower bound for these architectures.