
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Shahram Latifi, Pradip K. Srimani, "Transposition Networks as a Class of FaultTolerant Robust Networks," IEEE Transactions on Computers, vol. 45, no. 2, pp. 230238, February, 1996.  
BibTex  x  
@article{ 10.1109/12.485375, author = {Shahram Latifi and Pradip K. Srimani}, title = {Transposition Networks as a Class of FaultTolerant Robust Networks}, journal ={IEEE Transactions on Computers}, volume = {45}, number = {2}, issn = {00189340}, year = {1996}, pages = {230238}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.485375}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Transposition Networks as a Class of FaultTolerant Robust Networks IS  2 SN  00189340 SP230 EP238 EPD  230238 A1  Shahram Latifi, A1  Pradip K. Srimani, PY  1996 KW  Bubblesort graph KW  Cayley graph KW  embedding KW  fault diameter KW  fault tolerance KW  generator KW  permutation KW  star graph KW  transposition. VL  45 JA  IEEE Transactions on Computers ER   
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 bubblesort 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
[1] S.B. Akers and B. Krishnamurthy, "The fault tolerance of star graphs," Proc. Second Int'l Conf. Supercomputing, vol. III, pp. 270276,San Francisco, May 1987.
[2] S.B. Akers and B. Krishnamurthy, "The star graph: An attractive alternative to ncube," Proc. Int'l Conf. Parallel Processing (ICPP87), pp. 393400,St. Charles, Ill., Aug. 1987.
[3] S.B. Akers and B. Krishnamurthy, “A GroupTheoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555566, Apr. 1989.
[4] J. Bruck, R. Cypher, and C.T. Ho, "Wildcard Dimensions, Coding Theory and FaultTolerant Meshes and Hypercubes," Proc. 23rd Int'l Symp. FaultTolerant Computing, pp. 260267, June 1993.
[5] K. Day and A. Tripathi, "A comparative study of topological properties of hypercubes and star graphs," Technical Report TR 9110, 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. 3138, 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. 100106,St. Charles, Ill., 1991.
[8] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness.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. 4374, 1991.
[11] A. Kavianpour, "System level diagnosis strategies for nstar multiprocessor systems," Proc. Int'l Conf. Parallel Processing, pp. 297300, 1993.
[12] D. Knuth, The Art of Computer Programming, vol. 3: Sorting and Searching. AddisonWesley, 1973.
[13] S. Latifi, "Subcube embedability of folded hypercubes," Parallel Processing Letters, vol. 1, no. 1, pp. 4350, 1991.
[14] S. Latifi, “On the FaultDiameter of the Star Graph,” Information Processing Letters, vol. 46, pp. 143150, June 1993.
[15] S. Latifi and A. ElAmawy, "On folded hypercubes," Proc. Int'l Conf. Parallel Processing, vol. I, pp. 180187, 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. 361407, 1993.
[18] F.J. Meyer and D.K. Pradhan, "Fliptrees: Fault tolerant graphs with wide containers," IEEE Trans. Computers, vol. 37, no. 4, pp. 472478, 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. 18, 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. 389396, 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. 340343, Aug. 1990.
[22] K. Qiu, H. Meijer, and S.G. Akl, "On the cycle structure of star graphs," Technical Report 92341, 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 (ICDCS11), pp. 590597,Texas, 1991.
[24] S. Sur and P.K. Srimani, "Topological properties of star graphs," Computers&Mathematics with Applications, vol. 25, no. 12, pp. 8798, 1992.