Graceful Degradation on Hypercube Multiprocessors Using Data Redistribution

Abstract

A data redistribution approach to graceful degradation is described in this paper for hypercube multiprocessors. CPU-bound hypercube programs using the described second-order parametrized data distribution technique can run on a group of cubes of any size to achieve graceful degradation without recompila tion. A transmission mechanism has been designed to switch the performance of a second-order parametrized data distribution hypercube program to that of a corresponding first-order program when the latter is superior. A package of procedures has been implemented on the Intel iPSC/2 hypercube to support the approach.