
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
SeungWoo Seo, Tseyun Feng, HyoungIl Lee, "Permutation Realizability and Fault Tolerance Property of the InsideOut Routing Algorithm," IEEE Transactions on Parallel and Distributed Systems, vol. 10, no. 9, pp. 946957, September, 1999.  
BibTex  x  
@article{ 10.1109/71.798318, author = {SeungWoo Seo and Tseyun Feng and HyoungIl Lee}, title = {Permutation Realizability and Fault Tolerance Property of the InsideOut Routing Algorithm}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {10}, number = {9}, issn = {10459219}, year = {1999}, pages = {946957}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.798318}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Permutation Realizability and Fault Tolerance Property of the InsideOut Routing Algorithm IS  9 SN  10459219 SP946 EP957 EPD  946957 A1  SeungWoo Seo, A1  Tseyun Feng, A1  HyoungIl Lee, PY  1999 KW  Rearrangeable networks KW  Omega + Omega network KW  Benes network KW  looping algorithm KW  insideout routing algorithm KW  fault tolerance. VL  10 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—In this paper, we analyze ways of realizing permutations in a class of
[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,2701,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. 694702, Aug. 1980.
[3] D.H. Lawrie, “Access and Alignment of Data in an Array Processor,” IEEE Trans. Computers, vol. 24, no. 12, pp. 1,1451,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. 637647, 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. 443454, May 1982.
[6] N.F. Tzeng, P.C. Yew, and C.Q. Zhu, “A FaultTolerant Scheme for Multistage Interconnection Networks,” Proc. Int'l Conf. Parallel Processing, vol. 1, pp. 368375, 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,0991,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. 813822, May/June 1968.
[10] W.A. Waksman,“A permutation network,” J. ACM, vol. 15, pp. 159163, 1968.
[11] D.C. Opferman and N.T. TsaoWu, “On a Class of Rearrangeable Switching Networks,” Bell System Technical J., vol. 50, no. 5, pp. 1,5791,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,0571,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,3611,379, Nov. 1992.
[14] M.K. Kim, H. Yoon, and S.R. Maeng, “On the Correctness of InsideOut Routing Algorithm,” IEEE Trans. Computers, vol. 46, no. 7, pp. 820823, July 1997.
[15] D.K. Pradhan, “FaultTolerant Computing: Theory and Techniques,” vol. II, pp. 492496, chapter 6. Prentice Hall, 1986.
[16] T. Feng and C.L. Wu, “FaultDiagnosis for a Class of Multistage Interconnection Networks,” IEEE Trans. Computers, vol. 30, no. 10, pp. 743758, 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. 305312, 1992.
[18] S.K. Wysham and T. Feng, “On Routing a Faulty Benes Network,” Proc. Int'l Conf. Parallel Processing, vol. 1, pp. 351354, 1990.