
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
YuChee Tseng, ShuHui Chang, JangPing Sheu, "FaultTolerant Ring Embedding in a Star Graph with Both Link and Node Failures," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 12, pp. 11851195, December, 1997.  
BibTex  x  
@article{ 10.1109/71.640010, author = {YuChee Tseng and ShuHui Chang and JangPing Sheu}, title = {FaultTolerant Ring Embedding in a Star Graph with Both Link and Node Failures}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {8}, number = {12}, issn = {10459219}, year = {1997}, pages = {11851195}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.640010}, 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  FaultTolerant Ring Embedding in a Star Graph with Both Link and Node Failures IS  12 SN  10459219 SP1185 EP1195 EPD  11851195 A1  YuChee Tseng, A1  ShuHui Chang, A1  JangPing Sheu, PY  1997 KW  Fault tolerance KW  graph embedding KW  Hamiltonian cycle KW  interconnection network KW  processor allocation KW  ring KW  star graph. VL  8 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—The star graph interconnection network has been recognized as an attractive alternative to the hypercube network. Previously, the star graph has been shown to contain a Hamiltonian cycle. In this paper, we consider an injured star graph with some faulty links and nodes. We show that even with
[1] S.B. Akers, D. Harel, and B. Krishnamurthy, "The Star Graph: An Attractive Alternative to thenCube," Proc. Int'l Conf. Parallel Processing, pp. 393400, 1987.
[2] S.B. Akers and B. Krishnamurthy, “A GroupTheoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555566, Apr. 1989.
[3] S.G. Akl, K. Qiu, and I. Stojmenovic, "Fundamental Algorithms for the Star and Pancake Interconnection Networks with Applications to Computational Geometry," Networks, vol. 23, no. 4, pp. 215225, July 1993.
[4] N. Bagherzadeh, N. Nassif, and S. Latifi, “A Routing and Broadcasting Scheme on Faulty Star Graphs,” IEEE Trans. Computers, vol. 42, no. 11, pp. 1,3981,403, Nov. 1993.
[5] F. Berman and L. Snyder, "On Mapping Parallel Algorithms into Parallel Architectures," J. Parallel and Distributed Computing, vol. 4, pp. 439458, 1987.
[6] S. Bokhari, "On the Mapping Problem," IEEE Trans. Computers, vol. 30, pp. 207214, 1981.
[7] M.Y. Chan and S.J. Lee, "Distributed FaultTolerant Embeddings of Rings in Hypercubes," J. Parallel and Distributed Computing, vol. 11, pp. 6371, 1991.
[8] T.S. Chen, Y.C. Tseng, and J.P. Sheu, "Balanced Spanning Trees in Complete and Incomplete Star Graphs," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 7, pp. 717723, July 1996.
[9] 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.
[10] P. Fragopoulou and S.G. Akl, “Optimal Communication Algorithms on Star Graphs Using Spanning Tree Constructions,” J. Parallel and Distributed Computing, vol. 24, pp. 5571, 1995.
[11] Z. Jovanovic and J. Misic, "Fault Tolerance of the Star Graph Interconnection Network," Information Processing Letters, vol. 49, pp. 145150, 1994.
[12] J.S. Jwo, S. Lakshmivarahan, and S.K. Dhall, "Embeddings of Cycles and Grids in Star Graphs," Proc. Symp. Parallel and Distributed Processing, pp. 540547, 1990.
[13] T.H. Lai and W. White, "Mapping Pyramid Algorithms into Hypercubes," J. Parallel and Distributed Computing, pp. 4254, 1990.
[14] S. Latifi, “On the FaultDiameter of the Star Graph,” Information Processing Letters, vol. 46, pp. 143150, June 1993.
[15] S. Latifi, S. Zheng, and N. Bagherzadeh, "Optimal Ring Embedding in Hypercubes with Faulty Links," Proc. FaultTolerant Computing Symp., pp. 178184, 1992.
[16] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[17] B.P. Lester, The Art of Parallel Programming. Prentice Hall, 1993.
[18] V.E. Mendia and D. Sarkar, “Optimal Broadcasting in the Star Graph,” IEEE Trans. Parallel and Distributed Systems, vol. 3, pp. 389396, July 1992.
[19] J. Misic and Z. Jovanovic, "Communication Aspects of the Star Graph Interconnection Network," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 7, pp. 678687, July 1994.
[20] M. Nigam, S. Sahni, and B. Krishnamurthy, "Embedding Hamiltonians and Hypercubes in Star Interconnection Graphs," Proc. Int'l Conf. Parallel Processing, vol. III, pp. 340343, 1990.
[21] K. Qiu, "Broadcasting on the Star and Pancake Interconnection Networks," Proc. Int'l Parallel Processing Symp., pp. 660665, 1995.
[22] K. Qiu, S.G. Akl, and H. Meijer, "On Some Properties and Algorithms for the Star and Pancake Interconnection Networks," J. Parallel and Distributed Computing, vol. 22, pp. 1625, 1994.
[23] A. Sen, A. Sengupta, and S. Bandyopadhyay, "On Some Topological Properties of Hypercube, Incomplete Hypercube and Supercube," Proc. Int'l Parallel Processing Symp., pp. 636642, 1993.
[24] J.P. Sheu, C.T. Liaw, and T.S. Chen, “An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 6, June 1995.
[25] Y.C. Tseng, "Embedding a Ring in a Hypercube with Both Faulty Links and Faulty Nodes," Information Processing Letters, vol. 59, pp. 217222, 1996.
[26] Y.C. Tseng, "Resilient and Flexible Ring Embedding in an Injured Hypercube," J. Information Science and Eng., vol. 12, no. 4, pp. 567583, Dec. 1996.
[27] Y.C. Tseng and T.H. Lai, "Ring Embedding in an Injured Hypercube," Proc. Int'l Conf. Parallel Processing, vol. III, pp. 149152, 1993.
[28] Y.C. Tseng and T.H. Lai, "On the Embedding of a Class of Regular Graphs in a Faulty Hypercube," J. Parallel and Distributed Computing, vol. 37, pp. 200206, 1996.
[29] Y.C. Tseng and J.P. Sheu, "Toward Optimal Broadcast in a Star Graph Using Multiple Spanning Trees," IEEE Trans. Computers, vol. 46, no. 5, pp. 593599, May 997.