This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fault-Tolerant Routing in Multistage Interconnection Networks
March 1989 (vol. 38 no. 3)
pp. 385-393
The fault tolerance of multiprocessor systems with multistage interconnection networks under multiple faults in the network is studied. The fault tolerance is analyzed with respect to the criterion of dynamic full access (DFA) property of the processors in the system. A characterization of multiple faults in the Omega network is introduced and used to develop simple tests for the DFA capability

[1] Special Issue on Multiprocessing Technology,IEEE Computer, vol. 18, June 1985.
[2] T. Y. Feng, "A survey of interconnection networks,"IEEE Computer, vol. 14, pp. 12-27, Dec. 1981.
[3] J. Arlat and J. C. Laprie, "Performance-related dependability evaluation of supercomputer systems," inProc. 13th Annu. Int. Symp. Fault-Tolerant Comput., June 1983, pp. 276-283.
[4] C. R. Das and L. N. Bhuyan, "Reliability simulation of multiprocessor systems," inProc. Int. Conf. Parallel Processing, Aug. 1985, pp. 764-771.
[5] D. H. Lawrie, "Access and alignment of data in an array processor,"IEEE Trans. Comput., vol. C-24, pp. 1145-1155, Dec. 1975.
[6] J. P. Shen, "Fault-tolerance ofβ-networks in interconnected multicomputer systems," Ph.D. dissertation, Dep. E.E., U.S.C., USCEE Tech. Rep. 510, Aug. 1981.
[7] D. P. Agrawal, "Testing and fault-tolerance of multistage interconnection networks,"IEEE Computer, vol. 15, pp. 41-53, Apr. 1982.
[8] S. Thanawastien and V. P. Nelson, "Optimal fault detection test sequences for shuffle/exchange networks," inProc. 13th Annu. Int. Symp. Fault-Tolerant Comput., June 1983, pp. 442-445.
[9] C. L. Wu and T. Y. Feng, "Fault diagnosis for a class of multistage shuffle/exchange networks,"IEEE Trans. Comput., vol. C-30, pp. 743-758, Oct. 1981.
[10] D. P. Agrawal and J. S. Leu, "Dynamic accessibility testing and path length optimization of multistage interconnection networks," inProc. 4th Int. Conf. Disiribut. Comput. Syst., May, 1984, pp. 266-277.
[11] C. L Wu and T. Y. Feng, "On a class of multistage interconnection networks,"IEEE Trans. Comput., vol. C-29, pp. 694-702, Aug. 1980.
[12] D. P. Agrawal, "Graph theoretical analysis and design of multistage interconnection networks,"IEEE Trans. Comput., vol. C-32, pp. 637-648, July 1983.
[13] P.-Y. Chen, P.-C. Yew, and D. H. Lawrie, "Performance of packet switching in buffered single stage shuffle-exchange networks," inProc. 3rd Int. Conf. Distribut. Comput. Syst., Oct. 1982, pp. 622- 629.
[14] D. H. Lawrie and D. A. Pauda, "Analysis of message switching with shuffle-exchange in multiprocessors," inProc. Workshop Interconnection Networks Parallel Distribut. Processing, Apr. 1980, pp. 116-123.

Index Terms:
fault tolerant routing; multistage interconnection networks; multiprocessor systems; multiple faults; Omega network; k-stage shuffle/exchange networks; processing elements; fault tolerant computing; multiprocessor interconnection networks.
Citation:
A. Varma, C.S. Raghavendra, "Fault-Tolerant Routing in Multistage Interconnection Networks," IEEE Transactions on Computers, vol. 38, no. 3, pp. 385-393, March 1989, doi:10.1109/12.21125
Usage of this product signifies your acceptance of the Terms of Use.