
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
M.S. Chen, P.S. Yu, K.L. Wu, "Optimal NODUP AlltoAll Broadcast Schemes in Distributed Computing Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 12, pp. 12751285, December, 1994.  
BibTex  x  
@article{ 10.1109/71.334901, author = {M.S. Chen and P.S. Yu and K.L. Wu}, title = {Optimal NODUP AlltoAll Broadcast Schemes in Distributed Computing Systems}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {5}, number = {12}, issn = {10459219}, year = {1994}, pages = {12751285}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.334901}, 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  Optimal NODUP AlltoAll Broadcast Schemes in Distributed Computing Systems IS  12 SN  10459219 SP1275 EP1285 EPD  12751285 A1  M.S. Chen, A1  P.S. Yu, A1  K.L. Wu, PY  1994 KW  Index Termsdistributed processing; computer networks; optimal NODUP alltoall broadcast schemes;distributed computing systems; information dissemination; distributed system; oneportcommunication; kport communication VL  5 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Broadcast, referring to a process of information dissemination in a distributed systemwhereby a message originating from a certain node is sent to all other nodes in thesystem, is a very important issue in distributed computing. Alltoall broadcast means theprocess by which every node broadcasts its certain piece of information to all othernodes. In this paper, we first develop the optimal alltoall broadcast scheme for thecase of oneport communication, which means that each node can only send out onemessage in one communication step, and then, extend our results to the case ofmultiport communication, i.e., kport communication, meaning that each node can sendout k messages in one communication step. We prove that the proposed schemes areoptimal for the model considered in the sense that they not only require the minimalnumber of communication steps, but also incur the minimal number of messages.
[1] W. C. Athas and C. L. Seitz, "Multicomputers: messagepassing concurrent computers,"IEEE Comput. Mag., vol. 21, pp. 924, Aug. 1988.
[2] L. Bhuyan and D. P. Agrawal, "Generalized hypercube and hyperbus structures for a computer network,"IEEE Trans. Comput., vol. C33, no. 4, pp. 323333, Apr. 1984.
[3] M.S. Chen, K.L. Wu, and P. S. Yu, "Efficient decentralized consensus protocols in a distributed computing system,"Proc. 12th Int. Conf. Distrib. Computing Syst., June 1992, pp. 426433.
[4] Intel Corp., iPSC/2 User's Guide, Intel Corp., Mar. 1988.
[5] S.B. Davidson, H. GarciaMolina, and D. Skeen, "Consistency in a Partitioned Network,"ACM Computing Surveys, Vol. 17, No. 3, Sept. 1985, pp. 341370.
[6] R. Dechter and L. Kleinrock, "Broadcast communications and distributed algorithms,"IEEE Trans. Comput., vol. C35, no. 3, pp. 210219, Mar. 1986.
[7] P. J. Denning, "Parallel computing and its evolution,"Commun. ACM, vol. 29, pp. 11631167, Dec. 1986.
[8] A. M. Farley, "Minimal broadcast networks,"NETWORKS, vol. 9, pp. 313332, 1979.
[9] J. Halpern and Y. Moses, "Knowledge and common knowledge in a distributed environment,"J. ACM, vol. 37, no. 3, pp. 549587, July 1990.
[10] F. Harary,Graph Theory. Reading, MA: AddisonWesley, 1969.
[11] S. M. Hedetniemi, S. T. Hedetniemi, and A. Liestman, "A survey of broadcasting and gossiping in communication networks,"NETWORKS, vol. 18, pp. 319351, 1988.
[12] S. L. Johnsson and C. T. Ho, "Optimum broadcasting and personalized communication in hypercubes,"IEEE Trans. Comput., vol. 38, no. 9, pp. 12491268, Sept. 1989.
[13] P. Kermani and L. Kleinrock, "Virtual cutthrough: A new computer communication switching technique,"Comput. Netw., vol. 3, pp. 267286, 1979.
[14] T. V. Lakshman and A. K. Agrawala, "Efficient decentralized consensus protocols,"IEEE Trans. Software Eng., vol. SE12, no. 5, pp. 600607, May 1986.
[15] H. G. Landau, "The distribution of completion times for random communication in a task oriented group,"Bull. Math. Biophys., pp. 187201, 1954.
[16] S. Levitan, "Algorithms for broadcast protocol multiprocessor,"Distrib. Computing Syst., pp. 666671, 1982.
[17] D. A. Reed and D. C. Grunwald, "The performance of multicomputer interconnection networks,"IEEE Comput. Mag., vol. 20, pp. 6373, June 1987.
[18] K. A. Ross and C. R. B. Wright,Discrete Mathematics. Englewood Cliffs, NJ: PrenticeHall, 1985.
[19] C. L. Seitz, "The Cosmic Cube,"Commun. ACM, pp. 2233, Jan. 1985.
[20] A. Seress, "Quick gossiping without duplicate transmissions,"Graphs and Combinatorics, vol. 2, pp. 363383, 1986.
[21] K. G. Shin, "HARTS: A distributed realtime architecture,"IEEE Comput., pp. 2535, May 1991.
[22] L. G. Valiant, "A scheme for fast parallel communication,"SIAM, J. Computing, vol. 11, no. 2, pp. 350361, May 1982.
[23] K. N. Venkataraman, G. Cybenko, and D. W. Krumme, "Simultaneous broadcasting in multiprocessor networks," inProc. Int. Conf. Parallel Processing, 1986, pp. 555558.
[24] D. B. West, "Gossiping without duplicate transmission,"SIAM J. Alg. Disc. Meth., vol. 3, pp. 418419, 1982.
[25] C. B. Yang, R. C. T. Lee, and W.T. Chen, "Parallel graph algorithms based upon broadcasting communications,"IEEE Trans. Comput., vol. 39, no. 12, pp. 14681472, Dec. 1990.
[26] S. M. Yuan and A. K. Agrawala, "A class of optimal decentralized commit protocols," inProc. 8th Int. Conf. Distrib. Computing Syst., 1988, pp. 234241.