
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
E.A. Varvarigos, D.T. Bertsekas, "Multinode Broadcast in Hypercubes and Rings with Randomly Distributed Length of Packets," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 2, pp. 144154, February, 1993.  
BibTex  x  
@article{ 10.1109/71.207590, author = {E.A. Varvarigos and D.T. Bertsekas}, title = {Multinode Broadcast in Hypercubes and Rings with Randomly Distributed Length of Packets}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {4}, number = {2}, issn = {10459219}, year = {1993}, pages = {144154}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.207590}, 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  Multinode Broadcast in Hypercubes and Rings with Randomly Distributed Length of Packets IS  2 SN  10459219 SP144 EP154 EPD  144154 A1  E.A. Varvarigos, A1  D.T. Bertsekas, PY  1993 KW  Index Termsmultinode broadcast; hypercubes; rings; randomly distributed length of packets;probabilistic rule; hypercube networks; token networks VL  4 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Multinode broadcast (MNB) in a hypercube and in a ring network of processors isconsidered. It is assumed that the lengths of the packets that are broadcast are notfixed, but are distributed according to some probabilistic rule, and the optimal timesrequired to execute the MNB are compared for variable and for fixed packet lengths. Forlarge hypercubes, it is shown, under very general probabilistic assumptions on the packetlengths, that the MNB is completed in essentially the same time as when the packetlengths are fixed. In particular, the MNB is completed by time (1+ delta )T/sub s/ withprobability at least 1 epsilon , for any positive epsilon and delta , where T/sub s /is theoptimal time required to execute the MNB when the packet lengths are fixed at theirmean, provided that the size of the hypercube is large enough. In the case of the ring, itis proved that the average time required to execute a MNB when the packet lengths areexponentially distributed exceeds by a factor of ln n the corresponding time for the casethere the packet lengths are fixed at their mean, where n is the number of nodes of thering.
[1] D. P. Bertsekas and J. N. Tsitsiklis,Parallel and Distributed Computations. Englewood Cliffs, NJ: PrenticeHall, 1989.
[2] D. Bertsekas, C. Ozveren, G. Stamoulis, P. Tseng, and J. Tsitsiklis, "Optimal communication algorithms for hypercubes,"J. Parallel Distributed Comput., vol. 11, pp. 263275, 1991.
[3] S. N. Bhatt and I. C. F. Ipsen, "How to embed trees in hypercubes," Yale Univ., Dep. Comput. Sci., Res. Rep. YALEU/DCS/RR443, 1985.
[4] W.J. Dally and C.L. Seitz, "DeadlockFree Message Routing in Multiprocessor Interconnection Networks,"IEEE Trans. Computers, Vol. C36, No. 5, May 1987, pp. 547553.
[5] E. Dekel, D. Nassimi, and S. Sahni, "Parallel matrix and graph algorithms,"SIAM J. Comput., vol. 10, pp. 657673, 1981.
[6] I. S. Gradshteyn and I. M. Ryzhik,Table of Integrals. Series, and Products. Orlando, FL, Academic, 1980.
[7] 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.
[8] S. L. Johnsson, "Communication efficient basic linear algebra computations on hypercube architectures,"J. Parallel Distributed Comput., pp. 133172, 1987.
[9] S. L. Johnsson and C. T. Ho, "Optimum broadcasting and personalized communication in hypercubes,"IEEE Trans. Comput., vol. 38, pp. 12491268, 1989.
[10] D. W. Krumme, K. N. Venkataraman. and G. Cybenko. "The token exchange problem," Tufts Univ., Tech. Rep. 882, 1988.
[11] O. A. McBryan and E. F. Van de Velde, "Hypercube algorithms and implementations,"SIAM J. Scientif. Statist. Comput., vol. 8, no. 2, pp. s227s287, Mar. 1987.
[12] C. Ozveren, "Communication aspects of parallel processing," Lab. for Information and Decision Systems Rep. LIDSP1721, M.I.T., Cambridge, MA, 1987.
[13] S. M. Ross,Stochastic Processes. New York: Wiley, 1983.
[14] Y. Saad and M. H. Schultz, "Data communication in hypercubes,"J. Parallel Distributed Comput., vol. 6, pp. 115135, 1989.
[15] Y. Saad and M. H. Schultz, "Data communication in parallel architectures," Yale Univ., Report, Mar. 1986.
[16] Y. Saad and M. H. Schultz, "Topological properties of hypercubes."IEEE Trans. Comput., vol. 37, pp. 867872, 1988.
[17] G. Stamoulis and J. Tsitsiklis, "Efficient routing schemes for multiple broadcasts in hypercubes," Lab. for Information and Decision Systems, Rep. LIDSP1948, Feb. 1990.
[18] O. F. Stout and B. Wagar, "Passing messages in linkbound hypercubes," inProc. 1986 Hypercube Conf., SIAM, Philadelphia, PA, 1987, pp. 251257.
[19] D. M. Topkis. "Concurrent broadcast for information dissemination,"IEEE Trans. Software Eng., vol. 13, pp. 207231, 1983.
[20] E. A. Varvarigos, "Optimal communication algorithms for multiprocessor computers," M.S. thesis, Dept. of Elec. Eng. and Comput. Sci., M.I.T.; also Center for Intelligent Control Systems Rep., CICSTH192, Jan. 1990.
[21] E. A. Varvarigos and D. P. Bertsekas, "Optimal communication algorithms for isotropic tasks in hypercubes and wraparound meshes," Lab. for Information and Decision Systems. Rep. LIDSP1972, May 1990.