This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Testing the Dynamic Full Access Property of a Class of Multistage Interconnection Networks
November 1994 (vol. 5 no. 11)
pp. 1206-1210

The banyan network, and networks topologically equivalent to it, have recently beenadopted as interconnection networks in multiprocessor systems. Often, a multiprocessorsystem is reconfigured when the banyan network becomes faulty. It is possible to avoid acomplicated reconfiguration process as long as the faulty banyan network still possessesthe dynamic full access (DFA) property. In this paper, we determine a necessary andsufficient condition for a faulty banyan network to possess the DFA property and design a test procedure based on the condition. The test procedure can be used to decompose afaulty banyan network into subsystems possessing the DFA property. We also evaluatethe probability that a banyan network loses the DFA property, given the number of faultyswitching elements. It is found that as long as faults do not occur in switching elementslocated in the first and last stages, this probability is very small, even when there arequite a few faulty switching elements.

[1] L. R. Goke and G. J. Lipovski, "Banyan networks for partitioning multiprocessor systems," inProc. 1st Annu. Symp. Comput. Architecture, Dec. 1973, pp. 21-28.
[2] C. L. Wu and T. Y. Feng, "On a class of multistage interconnection networks,"IEEE Trans. Comput., vol. C-29, no. 8, pp. 694-702, Aug. 1980.
[3] C. P. Kruskal and M. Snir, "The performance of multistage interconnection network,"IEEE Trans. Comput., vol. C-32, no. 12, pp. 1091-1098, Dec. 1983.
[4] P. G. Bishop, D. G. Esp, M. Barnes, P. Humphreys, G. Dahl, and J. Lahti, "PODS--A project on diverse software,"IEEE Trans. Software Eng., vol. SE-12, no. 9, pp. 929-940, 1986.
[5] J. P. Shen and J. P. Hayes, "Fault-tolerance of dynamic-full-access interconnection networks,"IEEE Trans. Comput., vol. C-33, pp. 443-454, Mar. 1984.
[6] T. Y. Feng and I. P. Kao, "On fault-diagnosis of some multistage networks,"Proc. 1982 Int. Conf. Parallel Processing, 1982, pp. 99-101.
[7] D. P. Agrawal, "Testing and fault-tolerance of multistage interconnection networks,"IEEE Comput., 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 Ann. Int. Symp. Fault-Tolerant Comput., 1983, pp. 442-445.
[9] C. L. Wu and T. Y. Feng, "Fault diagnosis for a class of multistage interconnection 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,"IEEE Trans. Comput., vol. C-34, no. 3, pp. 255-266, Mar. 1985.
[11] A. Varma and C. S. Raghavendra, "Fault-tolerant routing in multistage interconnection networks,"IEEE Trans. Comput., vol. 38, pp. 385-393, Mar. 1989.
[12] V. P. Kumar and S. J. Wang, "Reliability enhancement by time and space redundancy in multistage interconnection networks,"IEEE Trans. Reliability, vol. 40, pp. 461-473, Oct. 1991.

Index Terms:
Index Termsmultiprocessor interconnection networks; computer testing; fault tolerant computing;reconfigurable architectures; dynamic full access property; multistage interconnectionnetworks; faulty banyan networ; multiprocessor system reconfiguration; test procedure;network decomposition; probability; faulty switching elements
Citation:
T.H. Lee, J.J. Chou, "Testing the Dynamic Full Access Property of a Class of Multistage Interconnection Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 11, pp. 1206-1210, Nov. 1994, doi:10.1109/71.329668
Usage of this product signifies your acceptance of the Terms of Use.