
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
YuChee Tseng, JangPing Sheu, "Toward Optimal Broadcast in a Star Graph Using Multiple Spanning Trees," IEEE Transactions on Computers, vol. 46, no. 5, pp. 593599, May, 1997.  
BibTex  x  
@article{ 10.1109/12.589231, author = {YuChee Tseng and JangPing Sheu}, title = {Toward Optimal Broadcast in a Star Graph Using Multiple Spanning Trees}, journal ={IEEE Transactions on Computers}, volume = {46}, number = {5}, issn = {00189340}, year = {1997}, pages = {593599}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.589231}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Toward Optimal Broadcast in a Star Graph Using Multiple Spanning Trees IS  5 SN  00189340 SP593 EP599 EPD  593599 A1  YuChee Tseng, A1  JangPing Sheu, PY  1997 KW  Alltoall broadcast KW  collective communication KW  multicomputer networks KW  onetoall broadcast KW  parallel architecture KW  routing KW  star graph. VL  46 JA  IEEE Transactions on Computers ER   
Abstract—In a multicomputer network, sending a packet typically incurs two costs: startup 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:
[1] S.B. Akers, D. Harel, and B. Krishnameurthy, "The Star Graph: An Attractive Alternative to the nCube," Proc. Int'l Conf. Parallel Processing, pp. 393400, 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. 215225, 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,3981,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. 639648, 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. 717723, 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. 3138, 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. 5571, 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,2491,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. 540547, 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. 97102, Jan. 1994.
[12] V.E. Mendia and D. Sarkar, “Optimal Broadcasting in the Star Graph,” IEEE Trans. Parallel and Distributed Systems, vol. 3, pp. 389396, 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. 678687, July 1994.
[14] K. Qiu, "Broadcasting on the Star and Pancake Interconnection Networks," Proc. Int'l Parallel Processing Symp., pp. 660665, 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. 1625, 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. 237241, 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, "FaultTolerant Ring Embedding in Star Graphs," Proc. Int'l Parallel Processing Symp., pp. 660665, 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. 215223, 1994.