
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Satoshi Fujita, "Neighborhood Information Dissemination in the Star Graph," IEEE Transactions on Computers, vol. 49, no. 12, pp. 13661370, December, 2000.  
BibTex  x  
@article{ 10.1109/12.895865, author = {Satoshi Fujita}, title = {Neighborhood Information Dissemination in the Star Graph}, journal ={IEEE Transactions on Computers}, volume = {49}, number = {12}, issn = {00189340}, year = {2000}, pages = {13661370}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.895865}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Neighborhood Information Dissemination in the Star Graph IS  12 SN  00189340 SP1366 EP1370 EPD  13661370 A1  Satoshi Fujita, PY  2000 KW  Interconnection network KW  information dissemination KW  broadcast KW  gossip KW  star graph. VL  49 JA  IEEE Transactions on Computers ER   
Abstract—This paper studies two neighborhood information dissemination problems in the star graph (
[1] S.B. Akers and B. Krishnamurthy, “A GroupTheoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555566, Apr. 1989.
[2] S.G. Akl and K. Qiu, “Fundamental Algorithms for the Star and Pancake Interconnection Networks with Applications to Computational Geometry,” Networks, vol. 23, pp. 215225, 1993.
[3] S.G. Akl and K. Qiu, “A Novel Routing Scheme on the Star and Pancake Networks and Its Applications,” Parallel Computing, vol. 19, pp. 95101, 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] P. Berthome, A. Ferreira, and S. Perennes, “Optimal Information Dissemination in Star and Pancake Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 12, pp. 1,2921,300, Dec. 1996.
[6] R.C. Entringer and P.J. Slater, “Gossips and Telegraphs,” J. Franklin Inst., vol. 307, pp. 353360, 1979.
[7] S. Even and B. Monien, “On the Number of Rounds Necessary to Disseminate Information,” Proc. First ACM Symp. Parallel Algorithms and Architectures, pp. 318327, 1989.
[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] P. Fragopoulou and S.G. Akl, “EdgeDisjoint Spanning Trees on the Star Network with Applications to Fault Tolerance,” IEEE Trans. Computers, vol. 45, no. 2, pp. 174185, Feb. 1996.
[10] P. Fraigniaud and E. Lazard, “Methods and Problems of Communication in Usual Networks,” Technical Report 9133, LIP ENSLyon, 1991.
[11] S. Fujita, S. Perennes, and J. Peters, “Neighbourhood Gossiping in Hypercubes,” Parallel Processing Letters, vol. 8, no. 2, pp. 189195, 1998.
[12] S.W. Graham and S.R. Seidel, "The Cost of Broadcasting on Star Graphs and Kary Hypercubes," IEEE Trans. Computers, vol. 42, no. 6, pp. 756759, June 1993.
[13] S.M. Hedetniemi, S.T. Hedetniemi, and A.L. Liestman, “A Survey of Gossiping and Broadcasting in Communication Networks,” Networks, vol. 18, pp. 319349, 1988.
[14] J. Hromkovic, R. Klasing, B. Monien, and R. Peine, “Dissemination of Information in Interconnection Networks (Broadcasting and Gossiping).” Combinatorial Network Theory, F. Hsu and D.Z. Du, eds., Science Press&AMS, 1995.
[15] D.W. Krumme, “Fast Gossiping for the Hypercube,” SIAM J. Computing, vol. 21, no. 2, pp. 365380, Apr. 1992.
[16] D.W. Krumme, G. Cybenko, and K.N. Venkataraman, “Gossiping in Minimal Time,” SIAM J. Computing, vol. 21, no. 1, pp. 111139, Feb. 1992.
[17] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[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.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.
[20] 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.