Robust shearsort on incomplete bypass meshes

Authors:
Behrooz Parhami;Ching Yu Hung
Affiliations:
-;-
Venue:
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Year:
1995

Citing 0
Cited 4

Optimal Sorting Algorithms on Incomplete Meshes with Arbitrary Fault Patterns

ICPP '97 Proceedings of the international Conference on Parallel Processing
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
Design of High-Performance Massively Parallel Architectures Under Pin Limitations and Non-Uniform Propagation Delay

PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
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

An incomplete 2-D bypass mesh is a rectangular m/spl times/n grid of p processing elements (PEs) in which faulty PEs have been bypassed in their respective rows and columns. Thus, two PEs that are separated only by faulty PEs in the same row or column become neighbors. We show that given O(log m) PE faults in each column, a robust version of the sorting scheme known as shearsort has the same O(m+n log m) asymptotic time complexity on such an incomplete mesh as on a complete mesh. We also demonstrate how the ability to compute on incomplete meshes is relevant to fault tolerance by presenting reconfiguration schemes to convert meshes with faulty PEs into incomplete bypass meshes.