High performance computing (HPC) systems often require substantial resources, and can
take up to several hours or days to execute. Upon a failure, it is important to loose as little …

High Performance Computing (HPC) systems are employed to solve hard problems and rely
on parallel algorithms which present very long execution times-up to several days. These …

In this paper, algorithmic fault-tolerant techniques are introduced for sorting algorithms on n-
dimensional hypercube multicomputers. We propose a fault-tolerant sorting algorithm that …

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 …

This paper considers sorting in SIMD hypercube multiprocessors in the presence of node
failures. The proposed algorithm correctly sorts up to 2/sup n/= N keys in a faulty SIMD …

In this paper, we present a reconfiguration approach to identify the maximal fault-free
subcube-ring for tolerating faults in injured hypercubes. The fault-free subcube-ring is …

To effectively utilize a faulty hypercube, it is often necessary to reconfigure the hypercube in
such a way as to retain as many fault-free nodes as possible. This inspires us to identify …

We examine the issue of running algorithms with a constant factor slowdown on a faulty
hypercube in a worst case scenario. We present two sets of novel results related to this …

Consider M unsorted elements and an n-dimensional hypercube Hn with⌊ 3n/2⌋− 1 faulty
nodes, where M⪢ N= 2 n. Employing a newly proposed partition strategy and the light …

The hypercube network is an attractive structure for parallel processing because of its
regularity. The problem of tolerating faulty processors in hypercubes has been studied by …