This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
New Bounds on the Reliability of Augmented Shuffle-Exchange Networks
January 1995 (vol. 44 no. 1)
pp. 123-129

Abstract—The reliability resulting from two forms of redundancy, spatial and temporal, in multistage interconnection networks is examined. The extra-stage shuffle-exchange network (SEN+) which is an example of the former is investigated here. The SEN+ is decomposed into two subnetworks connected by two extreme stages. Given k random faults in one subnetwork, our problem reduces to estimating the maximum and minimum number of switches in the other subnetwork that must be operational for full access, i.e., connection between every input (processor) and output (memory) pair. This investigation results in obtaining analytical estimates for the upper and lower bounds on its reliability which are a substantial improvement over existing ones.

We next examine the effect of wrap-around connections from each output node to its corresponding input node. This may provide a path between a source-destination pair under faults by diverting a given packet through one or more intermediate destinations. The reliability offered by this scheme that provides temporal redundancy is also estimated and compared with the scheme employing hardware redundancy.

Index Terms—Extra-stage shuffle-exchange network (SEN+), reliability, switch trees, wrap-around connections.

[1] G. B. Adams and H. J. Siegel,“The extra stage cube: A fault-tolerant interconnection network for supersystems,”IEEE Trans. Comput., vol. C-31, May 1982, pp. 443–454.
[2] J. T.Blake and K. S.Trivedi,“Multistage Interconnection Network Reliability,”IEEE Trans. Comput., vol. C-38, pp. 1600–1604, Nov. 1989.
[3] L. R. Goke and G. J. Lipovski,“Banyan networks for partitioning multiprocessor systems,”inFirst Ann. Symp. Comput. Archit., 1973, pp. 21–28.
[4] D. H.Lawrie,“Access and alignment of data in an array processor,''IEEE Trans. Comput., vol. C-24, pp. 1145–1155, Dec. 1975.
[5] B. L. Menezes, U. Bakhru and R. Sergent,“New bounds on the reliability of two augmented shuffle-exchange networks,”inProc. Int. Conf. on Parallel Processing, Aug. 1991, pp. I318–I322.
[6] B. L. Menezes and U. Bakhru,“New bounds on the reliability of two augmented shuffle-exchange networks,”Tech. Rep., CS-TR-2917 and UMIACS-TR-92-68, Univ. of Maryland, College Park, June 1992.
[7] R. Sergent,“New upper and lower bounds on the reliability of the extra-stage shuffle-exchange network,”Scholarly Paper submitted to the Dep. of Elect. Eng., Univ. of Maryland, College Park, Aug. 1990.
[8] J. P. Shen and J. P. Hayes,“Fault tolerance of dynamic full access interconnection networks,”IEEE Trans. Comput., vol. C-33, no. 3, pp. 241–248, Mar. 1984.
[9] C. Wu and T. Feng,“On a class of multistage interconnection networks,”IEEE Trans. Comput., vol. C-28, pp. 694–702, Aug. 1980.

Citation:
Bernard L. Menezes, Umesh Bakhru, "New Bounds on the Reliability of Augmented Shuffle-Exchange Networks," IEEE Transactions on Computers, vol. 44, no. 1, pp. 123-129, Jan. 1995, doi:10.1109/12.368004
Usage of this product signifies your acceptance of the Terms of Use.