Browse > Article

Fault Tolerant Static Shuffle-Exchange Network  

Choi Hong In (단국대학교 전자계산학과)
Abstract
A static shuffle-exchange network is not only useful for several parallel applications but also use less hardware than the popular multi-stage network or hypercube. Even though it has a lot of advantages, it has never been used in any implemented parallel machine. One of the reasons is there has not been any techniques to make the network fault-tolerant. In this paper multiple fault-tolerant static shuffle-exchange networks are presented. In order to recover from k faulty processing elements, a network needs at least 2 k additional processing elements and at most 4 k additional shuffle ports for each processing elements. By decomposing the k fault-tolerant static shuffle-exchange network into m identical modules, this paper shows that the reliability of the network can be increased.
Keywords
Fault-Tolerant; Parallel Processing; Network;
Citations & Related Records
연도 인용수 순위
  • Reference
1 H.S. Stone High-Performance Computer Architecture, Second Edition, Addison Wesley, Reading MA, 1990
2 H.S. Stone, 'Parallel processing with the perfect shuffle', IEEE Transactions on Computers vol C-20, 1971, pp 153-161   DOI   ScienceOn
3 K.E. Batcher, 'Low-cost Flexible Simulation with the Static Perfect Shuffle Network', Frontiers, Oct. 1992
4 K.E. Batcher, 'Decomposition of Perfect Shuffle Networks', Proceeding of the 1991 International Conference on Parallel Processing, CRC Press, Boca Raton FL, vol. I, 1991, pp 255-262
5 D.A. Rennels, 'On implementing fault tolerance in binary hypercubes', Proceedings of 16th International Symposium on Fault-Tolerant Computing, July 1986, pp 344-349