Tolerating multiple faults in Multistage Interconnection Networks with minimal extra stages

IEEE Transactions on Computers

Volumn 49, Issue 9, 2000, Pages 998-1004

  Fan, Chenggong Charles ^a,b   Bruck, Jehoshua ^a,b  

^a IEEE   (United States)

^b California Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXTRA STAGE INTERCONNECTION NETWORK; MINIMAL EXTRA STAGE; MULTISTAGE INTERCONNECTION NETWORK; SWITCH FAULT;

ALGORITHMS; BROADCASTING; FAULT TREE ANALYSIS; MASKS; SWITCHING FUNCTIONS; VECTORS;

INTERCONNECTION NETWORKS;

EID: 0034276274     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.869334     Document Type: Article

References (16)

1. G. Adams, D. Agrawal, and H. Siefel, "A Survey and Comparison of Fault-Tolerant Multistage Interconnection Networks," Computer, pp. 14-27, June 1987.
2. G. Adams and H. Siegel, "The Extra Stage Cube: A Fault-Tolerant Interconnection Network for Supersystems," IEEE Trans. Computers, vol. 31, no. 5, pp. 443-454, May 1982.
3. D.P. Agrawal, "Graph Theoretical Analysis and Design of Multistage Interconnection Networks," IEEE Trans. Computers, vol. 32, no. 7, pp. 637-648, July 1983.
4. V.E. Benes, "Optimal Rearrangeable Multistage Connecting Networks," Bell System Technical J., no. 4, II, July 1964.
5. J. Bruck and C. Ho, "Fault-Tolerant Cube Graphs and Coding Theory," IEEE Trans. Information Theory, Nov. 1996.
6. H. Cam and J. Fortes, "Rearrangeability of Shuffle-Exchange Networks," Proc. Third Symp. Frontiers of Massively Parallel Computation, pp. 303-314, Oct. 1990.
7. P.J. Chuang, "CGIN: A Fault Tolerant Modified Gamma Interconnection Network," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 12, pp. 1,303-1,308, Dec. 1996.
8. D. Knuth, The Art of Computer Programming: Sorting and Search. Reading, Mass.: Addison-Wesley, 1973.
9. V.P. Kumar and S.M. Reddy, "Augmented Shuffle-Exchange Multistage Interconnection Networks," Computer, pp. 30-40, June 1987.
10. F. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. San Mateo, Calif.: Morgan Kaufmann, 1992.
11. Y. Liao, M. Lu, and N.F. Tzeng, "The Palindrome Network for Fault-Tolerant Interconnection," Proc. Eighth IEEE Symp. Parallel and Distributed Processing, pp. 556-561, Oct. 1996.
12. N. Linial and M. Tarsi, "Interpolation between Bases and the Shuffle Exchange Network," European J. Combinatorics, pp. 29-39, Oct. 1989.
13. M. Pease, "The Indirect Binary n-Cube Microprocessor Array," IEEE Trans. Computers, vol. 26, no. 5, pp. 458-473, May 1977.
14. C. Shih and K. Batcher, "Adding Multiple-Fault Tolerance to Generalized Cube Networks," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 8, pp. 785-792, Aug. 1994.
15. A. Varma and C.S. Raghavendra, "Fault-Tolerant Routing in Multistage Interconnection Networks," IEEE Trans. Computers, vol. 38, no. 3, pp. 185-393, Mar. 1989.
16. M. Xu and X. Shen, "A New Fault-Tolerant Generalized Cube with an Extra Stage," Proc. Int'l Computer Science Conference (ICSC '92), pp. 99-105, Dec. 1992.