This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Permutation Realizability and Fault Tolerance Property of the Inside-Out Routing Algorithm
September 1999 (vol. 10 no. 9)
pp. 946-957

Abstract—In this paper, we analyze ways of realizing permutations in a class of $2log_2 N$- or ($2log_{2}N-1$)-stage rearrangeable networks. The analysis is based on the newly developed inside-out routing algorithm [1] and we derive the upper and lower bounds on the number of possible realizations of a permutation. It is shown that the algorithm can provide us with comparable degrees of freedom in realizing a given permutation as the well-known looping algorithm, while it can be more generally applied to a class of $2log_{2}N$- or ($2log_{2}N-1$)-stage rearrangeable networks. In finding a set of complete assignments for the center-stage cycles, alternate realizations of a permutation can be obtained by changing the initial position, changing the assigning direction, or even interchanging the first-level decompositions of the permutation. We also show that these numerable alternate realizations can be utilized to make the networks tolerate some sets of faults, i.e., control faults of SEs including stuck-at-straight and stuck-at-cross. Various cases of single control faults at the center stages and other stages are examined through examples. These new approaches originate from routing outward from center stages to outer stages; therefore, the center stages and two half networks may be treated separately.

[1] T.-Y. Feng, S.-W. Seo, "A New Routing Algorithm for a Class of Rearrangeable Networks," IEEE Trans. Computers, vol. 43, no. 11, pp. 1,270-1,280, Nov. 1994.
[2] C.L. Wu and T. Feng, “On a Class of Multistage Interconnection Networks,” IEEE Trans. Computers, vol. 29, no. 8, pp. 694-702, Aug. 1980.
[3] D.H. Lawrie, “Access and Alignment of Data in an Array Processor,” IEEE Trans. Computers, vol. 24, no. 12, pp. 1,145-1,155, Dec. 1975.
[4] J. Lenfant, “Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations,” IEEE Trans. Computers, vol. 27, no. 7, pp. 637-647, July 1978.
[5] G.B. AdamsIII and H.J. Siegel, “The Extra Stage Cube: A Fault Tolerant Interconnection Network for Supersystems,” IEEE Trans. Computers, vol. 31, no. 5, pp. 443-454, May 1982.
[6] N.-F. Tzeng, P.-C. Yew, and C.-Q. Zhu, “A Fault-Tolerant Scheme for Multistage Interconnection Networks,” Proc. Int'l Conf. Parallel Processing, vol. 1, pp. 368-375, 1985.
[7] K. Padmanabhan and D.H. Lawrie, “A Class of Redundant Path Multistage Interconnection Networks,” IEEE Trans. Computers, vol. 32, no. 12, pp. 1,099-1,107, Dec. 1983.
[8] V. Benes, Mathematical Theory of Connecting Networks. New York: Academic Press, 1965.
[9] A.E. JoelJr., “On Permutation Switching Networks,” Bell System Technical J., pp. 813-822, May/June 1968.
[10] W.A. Waksman,“A permutation network,” J. ACM, vol. 15, pp. 159-163, 1968.
[11] D.C. Opferman and N.T. Tsao-Wu, “On a Class of Rearrangeable Switching Networks,” Bell System Technical J., vol. 50, no. 5, pp. 1,579-1,600, May/June 1971.
[12] S. Andresen, “The Looping Algorithm Extended to Base$2^{t}$Rearrangeable Switching Networks,” IEEE Trans. Comm., vol. 25, pp. 1,057-1,063, Oct. 1977.
[13] Y.-M. Yeh, T.-Y. Feng, "On a Class of Rearrangeable Networks," IEEE Trans. Computers, vol. 41, no. 11, pp. 1,361-1,379, Nov. 1992.
[14] M.K. Kim, H. Yoon, and S.R. Maeng, “On the Correctness of Inside-Out Routing Algorithm,” IEEE Trans. Computers, vol. 46, no. 7, pp. 820-823, July 1997.
[15] D.K. Pradhan, “Fault-Tolerant Computing: Theory and Techniques,” vol. II, pp. 492-496, chapter 6. Prentice Hall, 1986.
[16] T. Feng and C.L. Wu, “Fault-Diagnosis for a Class of Multistage Interconnection Networks,” IEEE Trans. Computers, vol. 30, no. 10, pp. 743-758, Oct. 1981.
[17] Y.M. Yeh and T. Feng, “Fault Tolerant Routing on a Class of Rearrangeable Networks,” Proc. Int'l Conf. Parallel Processing, vol. 1, pp. 305-312, 1992.
[18] S.K. Wysham and T. Feng, “On Routing a Faulty Benes Network,” Proc. Int'l Conf. Parallel Processing, vol. 1, pp. 351-354, 1990.

Index Terms:
Rearrangeable networks, Omega + Omega network, Benes network, looping algorithm, inside-out routing algorithm, fault tolerance.
Citation:
Seung-Woo Seo, Tse-yun Feng, Hyoung-Il Lee, "Permutation Realizability and Fault Tolerance Property of the Inside-Out Routing Algorithm," IEEE Transactions on Parallel and Distributed Systems, vol. 10, no. 9, pp. 946-957, Sept. 1999, doi:10.1109/71.798318
Usage of this product signifies your acceptance of the Terms of Use.