
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Satoshi Fujita, Masafumi Yamashita, "Fast Gossiping on MeshBus Computers," IEEE Transactions on Computers, vol. 45, no. 11, pp. 13261330, November, 1996.  
BibTex  x  
@article{ 10.1109/12.544491, author = {Satoshi Fujita and Masafumi Yamashita}, title = {Fast Gossiping on MeshBus Computers}, journal ={IEEE Transactions on Computers}, volume = {45}, number = {11}, issn = {00189340}, year = {1996}, pages = {13261330}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.544491}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Fast Gossiping on MeshBus Computers IS  11 SN  00189340 SP1326 EP1330 EPD  13261330 A1  Satoshi Fujita, A1  Masafumi Yamashita, PY  1996 KW  Routing algorithm KW  mesh computer KW  shared bus KW  gossiping KW  packet length KW  optimal time bound. VL  45 JA  IEEE Transactions on Computers ER   
Abstract—A meshbus computer is a parallel computer in which nodes (i.e., processors) are arranged on a twodimensional array, and nodes on each row and nodes on each column, respectively, are connected by a shared bus. The nodes communicate with each other by exchanging packets through shared buses in CREW manner. Suppose that each node initially contains a piece of information called a token. A gossiping problem is the routing problem of exchanging tokens among all nodes in the computer, which has been studied extensively as a basic communication scheme for sharing information among nodes in a parallel computer. In this paper, we propose three gossiping algorithms for meshbus computers assuming that each packet can carry at most
[1] A. BarNoy and D. Peleg, "Square Meshes Are Not Always Optimal," IEEE Trans. Computers, vol. 40, pp. 196204, 1991
[2] Y.C. Chen, W.T. Chen, G.H. Chen, and J.P. Sheu, "Designing Efficient Parallel Algorithms on Mesh Connected Computers with Multiple Broadcasting," IEEE Trans. Parallel and Distributed Systems, vol. 1, pp. 241246, 1990.
[3] S. Cheung and F.C.M. Lau, "A Lower Bound for Permutation Routing on TwoDimensional Bused Meshes," Information Processing Letters, vol. 45, pp. 225228, Apr. 1993.
[4] S. Fujita and M. Yamashita, "Optimal Gossiping in MeshBus Computers," Parallel Processing Letters, vol. 3, pp. 357361, 1993.
[5] J.R. Goodman and P.J. Woest, “The Wisconsin Multicube: A New LargeScale CacheCoherent Multiprocessor,” Proc. 15th Ann. Int'l Symp. Computer Architecture, pp. 422431, 1988.
[6] 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.
[7] K. Iwama and Y. Kambayashi, "An O(log n) Parallel Connectivity Algorithm on the Mesh of Buses," Proc. IFIP 11th World Computer Congress, pp. 305310, 1989.
[8] K. Iwama, E. Miyano, and Y. Kambayashi, "Routing Problems on the Mesh of Buses," Proc. ISAAC '92 (Lecture Notes in Computer Science 650). SpringerVerlag, 1992.
[9] D.W. Krumme, G. Cybenko, and K.N. Venkataraman, “Gossiping in Minimal Time,” SIAM J. Computing, vol. 21, no. 1, pp. 111139, Feb. 1992.
[10] V.K. Prasanna Kumar and C.S. Raghavendra, "Array Processor with Multiple Broadcasting," Proc. 12th Int'l Symp. Computer Architecture, pp. 210, 1985.
[11] K. Nakano, T. Masuzawa, and N. Tokura, "Optimal Sorting Algorithms on Processor Arrays with Multiple Buses," Technical Report COMP, IEICE Japan, 917, 1991.
[12] Q.F. Stout, "Meshes with Multiple Buses," Proc. 27th FOCS, pp. 264273, 1986.