Multi-Message Multicasting

  • Teofilo F. Gonzalez
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1117)


We consider the Multi-Message Multicasting problem for the n processor fully connected static network. We present an efficient algorithm to construct a communication schedule with total communication time at most d2, where d is the maximum number of messages a processor may send (receive). We present an algorithm to construct for any problem instance of degree d and fan-out k (maximum number of processors that may receive a given message) a communication schedule with total communication time at most qd+k1/q(d−1), for any integer q≥2. The time complexity bound for our algorithm is O(n(d(q+k1/q))q). Our main result is a linear time approximation algorithm with a smaller approximation bound for small values of k(<100). We discuss applications and show how to adapt our algorithms to dynamic networks such as the Benes network, the interconnection network used in the Meiko CS-2.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    G. S. Almasi, and A. Gottlieb, Highly Parallel Computing, The Benjamin/ Cummings Publishing Co., Inc., New York, 1994.Google Scholar
  2. 2.
    E. G. Coffman, Jr, M. R. Garey, D. S. Johnson, and A. S. LaPaugh, Scheduling File Transfers in Distributed Networks, SIAM Journal on Computing, 14(3) (1985) pp. 744–780.CrossRefGoogle Scholar
  3. 3.
    H.-A. Choi, and S. L. Hakimi, Data Transfers in Networks, Algorithmica, Vol 3 (1988), pp. 223–245.CrossRefGoogle Scholar
  4. 4.
    H.-A. Choi, and S. L. Hakimi, Scheduling File Transfers for Trees and Odd Cycles, SIAM Journal on Computing, Vol. 16, No. 1, February 1987, pp. 162–168.CrossRefGoogle Scholar
  5. 5.
    H.-A. Choi, and S. L. Hakimi, “Data Transfers in Networks with Transceivers,” Networks, Vol. 17, (1987), pp. 393–421.Google Scholar
  6. 6.
    T. F. Gonzalez, “Unit Execution Time Shop Problems,” Mathematics of Operations Research,” Vol. 7, No. 1, February 1982, pp. 57–66.Google Scholar
  7. 7.
    T. F. Gonzalez, “Multimessage Multicasting in Networks,” UCSB Technical Report, (in preparation).Google Scholar
  8. 8.
    T. F. Gonzalez, and S. Sahni, Open Shop Scheduling to Minimize Finish Time, Journal of the Association for Computing Machinery, Vol. 23, No. 4, October 1976, pp. 665–679.Google Scholar
  9. 9.
    I. S. Gopal, G. Bongiovanni, M. A. Bonuccelli, D. T. Tang, and C. K. Wong, An Optimal Switching Algorithm for Multibean Satellite Systems with Variable Bandwidth Beams, IEEE Transactions on Communications, COM-30, 11 (1982) pp. 2475–2481.CrossRefGoogle Scholar
  10. 10.
    A J. Hopcroft, and R. M. Karp, An n 2.5 Algorithm for Maximum Matchings in Bipartite Graphs, SIAM J. Computing, (1973), pp. 225–231.Google Scholar
  11. 11.
    B. Hajek, and G. Sasaki, Link Scheduling in Polynomial Time, IEEE Transactions on Information Theory, Vol. 34, No. 5, Sept. 1988, pp. 910–917.CrossRefGoogle Scholar
  12. 12.
    I. Holyer, The NP-completeness of Edge-Coloring, SIAM J. Comput., 11 (1982), pp. 117–129.CrossRefGoogle Scholar
  13. 13.
    T. T. Lee, Non-blocking Copy Networks for Multicast Packet Switching, IEEE J. Selected Areas of Communication, Vol. 6, No 9, Dec. 1988, pp. 1455–1467.CrossRefGoogle Scholar
  14. 14.
    S. C. Liew, A General Packet Replication Scheme for Multicasting in Interconnection Networks, Proceedings IEEE INFOCOM '95, Vol. 1 (1995), pp. 394–401.CrossRefGoogle Scholar
  15. 15.
    P. I. Rivera-Vega, R, Varadarajan, and S. B. Navathe, “Scheduling File Transfers in Fully Connected Networks,” Networks, Vol. 22, (1992), pp. 563–588.Google Scholar
  16. 16.
    J. S. Turner, A Practical Version of Lee's Multicast Switch Architecture, IEEE Transactions on Communications, Vol. 41, No 8, Aug. 1993, pp. 1166–1169.CrossRefGoogle Scholar
  17. 17.
    V. G. Vizing, On an Estimate of the Chromatic Class of a p-graph, Diskret. Analiz., 3 (1964), pp. 25–30 (In Russian).Google Scholar
  18. 18.
    J. Whitehead, The Complexity of File Transfer Scheduling with Forwarding, SIAM Journal on Computing Vol. 19, No 2, April 1990, pp. 222–245.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Teofilo F. Gonzalez
    • 1
  1. 1.Department of Computer ScienceUniversity of CaliforniaSanta BarbaraUSA

Personalised recommendations