
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Johanne Cohen, Pierre Fraigniaud, JeanClaude König, André Raspaud, "Optimized Broadcasting and Multicasting Protocols in CutThrough Routed Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 8, pp. 788802, August, 1998.  
BibTex  x  
@article{ 10.1109/71.706050, author = {Johanne Cohen and Pierre Fraigniaud and JeanClaude König and André Raspaud}, title = {Optimized Broadcasting and Multicasting Protocols in CutThrough Routed Networks}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {9}, number = {8}, issn = {10459219}, year = {1998}, pages = {788802}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.706050}, 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  Optimized Broadcasting and Multicasting Protocols in CutThrough Routed Networks IS  8 SN  10459219 SP788 EP802 EPD  788802 A1  Johanne Cohen, A1  Pierre Fraigniaud, A1  JeanClaude König, A1  André Raspaud, PY  1998 KW  Broadcasting KW  multicasting KW  wormhole KW  circuitswitched networks. VL  9 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—This paper addresses the onetoall broadcasting problem and the onetomany broadcasting problem, usually simply called
In the line model, it is well known that one can compute in polynomial time a
[1] J.C. Bermond, L. Gargano, S. Perennes, A. Rescigno, and U. Vaccaro, "Efficient Collective Communication in Optical Networks," Technical Report 9565, I3S, SophiaAntipolis, France, 1995.
[2] J. Edmonds, "Maximum Matching and a Polyhedron With 0,1Vertices," J. Research Nat'l Bureau of StandardsB, vol. 69B, pp. 125130, 1965.
[3] A. Farley, "MinimumTime Line Broadcast Networks," Networks, vol. 10, pp. 5970, 1980.
[4] R. Feldmann, J. Hromkovic, S. Madhavapeddy, B. Monien, and P. Mysliwietz, "Optimal Algorithms for Dissemination of Information in Generalized Communication Modes," Discrete Applied Mathematics, vol. 53, nos. 13, pp. 5578, 1994.
[5] E. Fleury and P. Fraigniaud, "Strategies for Multicasting in Meshes," Proc. 23rd Int'l Conf. Parallel Processing (ICPP'94), 1994.
[6] E. Fleury and P. Fraigniaud, "Analysis of DeadlockFree PathBased Wormhole Multicasting in Meshes in Case of Contentions," Proc. Sixth Symp. Frontiers of Massively Parallel Computing (Frontiers '96),Annapolis, Md., Oct. 1996.
[7] Message Passing Interface Forum, "MPI: A MessagePassing Interface Standard," Technical Report CS93214, Univ. of Tennessee, Apr. 1994.
[8] P. Fraigniaud, "Broadcasting in Trees," Research Report 9526, Laboratoire de l'Informatique du Parallélisme, ENSLyon, France, 1995.
[9] P. Fraigniaud and J. Peters, "Structured Communication in Torus Networks," Proc. 28th Ann. Hawaii Int'l Conf. System Sciences, pp. 584593, 1995.
[10] W. Gropp, E. Lusk, and A. Skjellum, Using MPI: Portable Parallel Programming with the Message Passing Interface. MIT Press, 1994.
[11] S.M. Hedetniemi, S.T. Hedetniemi, and A. Liestman, "A Survey of Gossiping and Broadcasting in Communication Networks," Networks, vol. 18, pp. 319349, 1986.
[12] C.T. Ho and M.Y. Kao, "Optimal Broadcast in AllPort WormholeRouted Hypercubes," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 2, pp. 200318, Feb. 1995.
[13] J. Hromkovic, R. Klasing, and E. Stohr, "Dissemination of Information in VertexDisjoint Paths Mode," Computer and Artificial Intelligence, vol. 15, no. 4, pp. 295318, 1996.
[14] J. Hromkovic, R. Klasing, E. Stohr, and H. Wagener, " Gossiping in VertexDisjoint Paths Mode in dDimensional Grids and Planar Graphs," Information and Computation, vol. 123, no. 1, pp. 1728, 1995.
[15] J. Hromkovic, R. Klasing, W. Unger, and H. Wagerer, "Optimal Algorithm for Broadcast and Gossip in the EdgeDisjoint Path Mode," Proc. Fourth Scandinavian Workshop Algorithm Theory (SWAT'94), pp. 219230, 1994.
[16] S.L. Johnsson, "Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures," J. Parallel and Distributed Computing, vol. 4, pp. 133172, 1987.
[17] 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.
[18] J.O. Kane and J. Peters, "Line Broadcasting in Cycles," Discrete Applied Mathematics, to appear.
[19] G. Kortsarz and D. Peleg, "Approximation Algorithms for Minimum Time Broadcast," Proc. 1992 Israel Symp. Theory of Computer Science, 1992.
[20] C. Laforest, "Broadcast and Gossip in LineCommunication Mode," Technical Report 1005, Laboratoire de Recherche en Informatique, Univ. ParisSud, Orsay, France, 1995.
[21] C. Laforest, "Gossip in Trees Under LineCommunication Mode," Proc. EuroPar'96, L. Bougé, A. Mignotte, and Y. Robert, eds., pp. 333340. Springer Verlag, 1996.
[22] Y. Lan, A.H. Esfahanian, and L.M. Ni, "Multicast in Hypercube Multiprocessors," J. Parallel and Distributed Computing, vol. 8, pp. 3041, Jan. 1990.
[23] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[24] X. Lin and L.M. Ni, "Multicast Communication in Multicomputer Networks," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 10, pp. 1,1041,117, 1993.
[25] M. Ajmone Marshan, A. Bianco, E. Leonardi, and F. Neri, “Topologies for WavelengthRouting AllOptical Networks,” IEEE/ACM Trans. Networking, vol. 1, pp. 534546, Oct. 1993.
[26] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 6276, Feb. 1993.
[27] J. Peters and M. Syska, "CircuitSwitched Broadcasting in Torus Networks," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 3, pp. 246255, 1996.
[28] Y. Saad and M.H. Schultz, "Data Communication in Hypercubes," J. Parallel and Distributed Computing, vol. 6, pp. 115135, 1989.
[29] Y. Saad and M.H. Schultz, "Data Communication in Parallel Architectures," Parallel Computing, vol. 11, pp. 131150, 1989.
[30] P. Slater, E. Cockayne, and S. Hedetniemi, "Information Dissemination in Trees," SIAM J. Computing, vol. 10, no. 4, pp. 692701, 1981.
[31] P. Winter, "Steiner Problem in Networks: A Survey," IEEE Networks, vol. 17, no. 2, pp. 129167, 1987.
[32] H. Xu, P. McKinely, and L. Ni, "Efficient Implementation of Barrier Synchronization in WormholeRouted Hypercube Multicomputers," J. Parallel and Distributed Computing, vol. 16, pp. 172184, 1992.