Optimal Sorting Algorithms on Incomplete Meshes with Arbitrary Fault Patterns

Authors:
Chi-Hsiang Yeh;Behrooz Parhami
Affiliations:
-;-
Venue:
ICPP '97 Proceedings of the international Conference on Parallel Processing
Year:
1997

Citing 7
Cited 2

An optimal sorting algorithm for mesh connected computers

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Concentrated regular data streams on grids: sorting and routing near to the bisection bound

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Multi-scale self-simulation: a technique for reconfiguring arrays with faults

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Sorting n2 Numbers on n x n Meshes

IEEE Transactions on Parallel and Distributed Systems
Robust shearsort on incomplete bypass meshes

IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Asymptotically tight bounds for computing with faulty arrays of processors

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science

RACE: A Software-Based Fault Tolerance Scheme for Systematically Transforming Ordinary Algorithms to Robust Algorithms

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
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

In this paper, we propose simple and efficient algorithms for sorting on incomplete meshes. No hardware redundancy is required and no assumption is made about the availabil-ity of a complete submesh. The proposed robust sorting al-gorithms are very efficient when only a few processors are faulty and degrade gracefully as the number of faults in-creases. In particular, we show that 1-1 sorting (1 key per healthy processor) in row-major or snakelike row-major or-der can be performed in 3n+o(n) communication and com-parison steps on an n . n incomplete mesh that has an arbi-trary pattern of o(pn) faulty processors. This is the fastest algorithm reported thus far for sorting in row-major and snakelike row-major orders on faulty meshes and the time complexity is quite close to its lower bound.