Fault-tolerant sorting in SIMD hypercubes

L Bhuyan - … of 9th International Parallel Processing Symposium, 1995 - ieeexplore.ieee.org
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 …
被引用次数：2 相关文章

Fault-tolerant sorting in SIMD hypercubes

A Mishra, Y Chang, L Bhuyan… - Proceedings of 9th …, 1995 - computer.org
Orientation of polygon, convexity or concavity of vertices and point inclusion test are three
fundamental problems in geometry. In this paper, a novel method to identify the orientation …

Fault Tolerant Sorting in SIMD Hypercubes

A Mishra, Y Chang, L Bhuyan, F Lombardi - 2001 - dl.acm.org
This paper considers sorting in SIMD hypercube multiprocessors in the presence of node
failures. The proposed algorithm correctly sorts up to 2n= N keys in a faulty SIMD hypercube …

Fault-tolerant sorting in SIMD hypercubes

A Mishra, YK Chang, L Bhuyan… - IEEE Symposium on …, 1995 - researchoutput.ncku.edu.tw
This paper considers sorting in SIMD hypercube multiprocessors in the presence of node
failures. The proposed algorithm correctly sorts up to 2 n= N keys in a faulty SIMD hypercube …

Fault-tolerant sorting in SIMD hypercubes

A Mishra, Y Chang, LN Bhuyan… - Proceedings of the 9th …, 1995 - dl.acm.org
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 …