This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Toward Optimal Broadcast in a Star Graph Using Multiple Spanning Trees
May 1997 (vol. 46 no. 5)
pp. 593-599

Abstract—In a multicomputer network, sending a packet typically incurs two costs: start-up time and transmission time. This work is motivated by the observation that most broadcast algorithms in the literature for the star graph networks only try to minimize one of the costs. Thus, many algorithms, though claimed to be optimal, are only so when one of the costs is negligible. In this paper, we try to optimize both costs simultaneously for four types of broadcast problems: one-to-all or all-to-all broadcasting in an n-star network with either one-port or all-port communication capability. As opposed to earlier solutions, the main technique used in this paper is to construct from a source node multiple spanning trees, along each of which one partition of the broadcast message is transmitted.

[1] S.B. Akers, D. Harel, and B. Krishnameurthy, "The Star Graph: An Attractive Alternative to the n-Cube," Proc. Int'l Conf. Parallel Processing, pp. 393-400, 1987.
[2] 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. 215-225, July 1993.
[3] 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,398-1,403, Nov. 1993.
[4] J.-C. Bermond, P. Michallon, and D. Trystram, "Broadcasting in Wraparound Meshes with Parallel Monodirectional Links," Parallel Computing, vol. 18, pp. 639-648, 1992.
[5] J.A. Bondy and U.S.R. Murthy, Graph Theory with Applications.Amsterdam: NorthHolland, 1979.
[6] 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. 717-723, July 1996.
[7] 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.
[8] P. Fragopoulou and S.G. Akl, “Optimal Communication Algorithms on Star Graphs Using Spanning Tree Constructions,” J. Parallel and Distributed Computing, vol. 24, pp. 55-71, 1995.
[9] S.L. Johnsson and C.T. Ho,“Spanning graphs for optimum broadcasting and personalizedcommunication in hypercubes,” IEEE Trans. Computers, vol. 38, no. 9, pp. 1,249-1,268, Sept. 1989.
[10] J.-S. Jwo, S. Lakshmivarahan, and S.K. Dhall, "Embeddings of Cycles and Grids in Star Graphs," Proc. Symp. Parallel and Distributed Processing, pp. 540-547, 1990.
[11] S. Latifi and N. Bagherzadeh, "Incomplete Star: An Incrementally Scalable Network Based on the Star Graph," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 1, pp. 97-102, Jan. 1994.
[12] 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.
[13] J. Misic and Z. Jovanovic, "Communication Aspects of the Star Graph Interconnection Network," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 7, pp. 678-687, July 1994.
[14] K. Qiu, "Broadcasting on the Star and Pancake Interconnection Networks," Proc. Int'l Parallel Processing Symp., pp. 660-665, 1995.
[15] 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. 16-25, 1994.
[16] J.-P. Sheu, C.-T. Liaw, and T.-S. Chen, “A Broadcasting Algorithm in Star Graph Interconnection Networks,” Information Processing Letters, vol. 48, pp. 237-241, 1993.
[17] 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.
[18] Y.C. Tseng, S.H. Chang, and J.P. Sheu, "Fault-Tolerant Ring Embedding in Star Graphs," Proc. Int'l Parallel Processing Symp., pp. 660-665, 1996.
[19] Y.-C. Tseng, T.-H. Lai, and L.-F. Wu, "Matrix Representation of Graph Embedding in a Hypercube," J. Parallel and Distributed Computing, vol. 23, pp. 215-223, 1994.

Index Terms:
All-to-all broadcast, collective communication, multi-computer networks, one-to-all broadcast, parallel architecture, routing, star graph.
Citation:
Yu-Chee Tseng, Jang-Ping Sheu, "Toward Optimal Broadcast in a Star Graph Using Multiple Spanning Trees," IEEE Transactions on Computers, vol. 46, no. 5, pp. 593-599, May 1997, doi:10.1109/12.589231
Usage of this product signifies your acceptance of the Terms of Use.