12
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

A RELIABLE SORTING ALGORITHM ON HYPERCUBE MULTICOMPUTERS

&
Pages 165-186 | Published online: 02 Mar 2007
 

Abstract

In this paper, we present an algorithm-based fault-tolerant technique, namely the median-splitting strategy, for designing a reliable sorting algorithm. Combining the median-splitting strategy with bitonic sorting algorithm, a reliable sorting algorithm is proposed on the hypercube multicomputers. By the strategies of duplicating data and rollback, the proposed algorithm can detect transient faults and automatically correct errors without any hardware modification. We also implement our algorithm on nCUBE/1 hypercube machines with 64 processors. The simulation results show that our sorting algorithm is reliable and cost-effective.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.