A generalized fault-tolerant sorting algorithm on a product network

Authors:
Yuh-Shyan Chen;Chih-Yung Chang;Tsung-Hung Lin;Chun-Bo Kuo
Affiliations:
Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan, ROC;Department of Computer Science and Information Engineering, Tamkang University, Taipei, Taiwan, ROC;Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan, ROC;Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan, ROC
Venue:
Journal of Systems Architecture: the EUROMICRO Journal
Year:
2005

Citing 11
Cited 0

Reconfiguring a hypercube in the presence of faults

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
K-Way Bitonic Sort

IEEE Transactions on Computers
Product-shuffle networks: toward reconciling shuffles and butterflies

Discrete Applied Mathematics - Special double volume: interconnection networks
Homogeneous product networks for processor interconnection

Homogeneous product networks for processor interconnection
Folded Petersen Cube Networks: New Competitors for the Hypercubes

IEEE Transactions on Parallel and Distributed Systems
Mesh-Connected Trees: A Bridge Between Grids and Meshes of Trees

IEEE Transactions on Parallel and Distributed Systems
Efficient VLSI Layouts for Homogeneous Product Networks

IEEE Transactions on Computers
Products of Networks with Logarithmic Diameter and Fixed Degree

IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures

IEEE Transactions on Parallel and Distributed Systems
Generalized Algorithm for Parallel Sorting on Product Networks

IEEE Transactions on Parallel and Distributed Systems
Reliable broadcasting in product networks in the presence of faulty nodes

SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A product network defines a class of topologies that are very often used such as meshes, tori, and hypercubes, etc. This paper proposes a generalized algorithm for fault-tolerant parallel sorting in product networks. To tolerate r - 1 faulty nodes, an r-dimensional product network containing faulty nodes is partitioned into a number of subgraphs such that each subgraph contains at most one fault. Our generalized sorting algorithm is divided into two steps. First, a single-fault sorting operation is presented to correctly performed on each faulty subgraph containing one fault. Second, each subgraph is considered a supernode, and a fault-tolerant multiway merging operation is presented to recursively merge two sorted subsequences into one sorted sequence. Our generalized sorting algorithm can be applied to any product network only if the factor graph of the product graph can be embedding in a ring. Further, we also show the time complexity of our sorting operations on a grid, hypercube, and Petersen cube. Performance analysis illustrates that our generalized sorting scheme is a truly efficient fault-tolerant algorithm.