This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Transposition Networks as a Class of Fault-Tolerant Robust Networks
February 1996 (vol. 45 no. 2)
pp. 230-238

Abstract—The paper proposes designs of interconnection networks (graphs) which can tolerate link failures. The networks under study belong to a subclass of Cayley graphs whose generators are subsets of all possible transpositions. We specifically focus on star and bubble-sort networks. Our approach is to augment existing dimensions (or generators) with one or more dimensions. If the added dimension is capable of replacing any arbitrary failed dimension, it is called a wildcard dimension. It is shown that, up to isomorphism among digits used in labeling the vertices, the generators of the star graph are unique. The minimum number of extra dimensions needed to acquire i wildcard dimensions is derived for the star and bubble-sort networks. Interestingly, the optimally augmented star network coincides with the Transposition network, Tn. Transposition networks are studied rigorously. These networks are shown to be optimally fault-tolerant. Tn is also shown to possess wide containers with short length. Fault-diameter of Tn is shown to be n. While the Tn can efficiently embed star and bubble-sort graphs, it can also lend itself to an efficient embedding of meshes and hypercubes.

[1] S.B. Akers and B. Krishnamurthy, "The fault tolerance of star graphs," Proc. Second Int'l Conf. Supercomputing, vol. III, pp. 270-276,San Francisco, May 1987.
[2] S.B. Akers and B. Krishnamurthy, "The star graph: An attractive alternative to n-cube," Proc. Int'l Conf. Parallel Processing (ICPP-87), pp. 393-400,St. Charles, Ill., Aug. 1987.
[3] S.B. Akers and B. Krishnamurthy, “A Group-Theoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555-566, Apr. 1989.
[4] J. Bruck, R. Cypher, and C.-T. Ho, "Wildcard Dimensions, Coding Theory and Fault-Tolerant Meshes and Hypercubes," Proc. 23rd Int'l Symp. Fault-Tolerant Computing, pp. 260-267, June 1993.
[5] K. Day and A. Tripathi, "A comparative study of topological properties of hypercubes and star graphs," Technical Report TR 91-10, Computer Science Dept., Univ. of Minnesota, Minneapolis, Minn., May 1991.
[6] K. Day and A. Tripathi, "A Comparative Study of Topological Properties of Hypercubes and Star Graphs," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 1, pp. 31-38, Jan. 1994.
[7] P. Fragopoulou and S.F. Akl, "Parallel algorithm for computing Fourier transforms on the star graph," Proc. Int'l Conf. Parallel Processing, vol. III, pp. 100-106,St. Charles, Ill., 1991.
[8] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[9] J. Juang, S. Lakshmivarahan, and S.K. Dhall, "Analysis of interconnection networks based on Cayley graphs of strong generating sets," private communication, 1994.
[10] J.S. Jwo, S. Lakshmivarahan, and S.K. Dhall, "Embedding of cycles and grids in star graphs," J. Circuits, Systems and Computers, vol. 1, no. 1, pp. 43-74, 1991.
[11] A. Kavianpour, "System level diagnosis strategies for n-star multiprocessor systems," Proc. Int'l Conf. Parallel Processing, pp. 297-300, 1993.
[12] D. Knuth, The Art of Computer Programming, vol. 3: Sorting and Searching. Addison-Wesley, 1973.
[13] S. Latifi, "Subcube embedability of folded hypercubes," Parallel Processing Letters, vol. 1, no. 1, pp. 43-50, 1991.
[14] S. Latifi, “On the Fault-Diameter of the Star Graph,” Information Processing Letters, vol. 46, pp. 143-150, June 1993.
[15] S. Latifi and A. El-Amawy, "On folded hypercubes," Proc. Int'l Conf. Parallel Processing, vol. I, pp. 180-187, 1989.
[16] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[17] S. Lakshmivarahan, J.S. Jwo, and S.K. Dhall, "Symmetry in interconnection networks based on Caley graphs of permutation groups: A survey," Parallel Computing, vol. 19, pp. 361-407, 1993.
[18] F.J. Meyer and D.K. Pradhan, "Flip-trees: Fault tolerant graphs with wide containers," IEEE Trans. Computers, vol. 37, no. 4, pp. 472-478, Apr. 1988.
[19] A. Menn and A.K. Somani, "An efficient sorting algorithm for the star graph interconnection network," Proc. Int'l Conf. Parallel Processing, vol. III, pp. 1-8, St. Charles, Ill., 1990.
[20] V.E. Mendia and D. Sarkar, “Optimal Broadcasting in the Star Graph,” IEEE Trans. Parallel and Distributed Systems, vol. 3, pp. 389-396, July 1992.
[21] M. Nigam, S. Sahni, and B. Krishnamurthy, "Embedding Hamiltonians and hypercubes in star interconnection graphs," Proc. Int'l Conf. Parallel Processing, pp. 340-343, Aug. 1990.
[22] K. Qiu, H. Meijer, and S.G. Akl, "On the cycle structure of star graphs," Technical Report 92-341, Dept. of Computer Science, Queen's Univ., Ontario, Canada, Nov. 1992.
[23] S. Sur and P.K. Srimani, "Super star: A new optimally fault tolerant network architecture," Proc. Int'l Conf. Distributed Computing Systems (ICDCS-11), pp. 590-597,Texas, 1991.
[24] S. Sur and P.K. Srimani, "Topological properties of star graphs," Computers&Mathematics with Applications, vol. 25, no. 12, pp. 87-98, 1992.

Index Terms:
Bubble-sort graph, Cayley graph, embedding, fault diameter, fault tolerance, generator, permutation, star graph, transposition.
Citation:
Shahram Latifi, Pradip K. Srimani, "Transposition Networks as a Class of Fault-Tolerant Robust Networks," IEEE Transactions on Computers, vol. 45, no. 2, pp. 230-238, Feb. 1996, doi:10.1109/12.485375
Usage of this product signifies your acceptance of the Terms of Use.