Skip to main content
SpringerLink
Log in

Multi-Message Multicasting

  • Conference paper
  • First Online:
Book cover Parallel Algorithms for Irregularly Structured Problems (IRREGULAR 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1117))

Abstract

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 d 2, 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+k 1/q(d−1), for any integer q≥2. The time complexity bound for our algorithm is O(n(d(q+k 1/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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. S. Almasi, and A. Gottlieb, Highly Parallel Computing, The Benjamin/ Cummings Publishing Co., Inc., New York, 1994.

    Google Scholar 

  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.

    Article  Google Scholar 

  3. H.-A. Choi, and S. L. Hakimi, Data Transfers in Networks, Algorithmica, Vol 3 (1988), pp. 223–245.

    Article  Google Scholar 

  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.

    Article  Google Scholar 

  5. H.-A. Choi, and S. L. Hakimi, “Data Transfers in Networks with Transceivers,” Networks, Vol. 17, (1987), pp. 393–421.

    Google Scholar 

  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. T. F. Gonzalez, “Multimessage Multicasting in Networks,” UCSB Technical Report, (in preparation).

    Google Scholar 

  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. 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.

    Article  Google Scholar 

  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. B. Hajek, and G. Sasaki, Link Scheduling in Polynomial Time, IEEE Transactions on Information Theory, Vol. 34, No. 5, Sept. 1988, pp. 910–917.

    Article  Google Scholar 

  12. I. Holyer, The NP-completeness of Edge-Coloring, SIAM J. Comput., 11 (1982), pp. 117–129.

    Article  Google Scholar 

  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.

    Article  Google Scholar 

  14. S. C. Liew, A General Packet Replication Scheme for Multicasting in Interconnection Networks, Proceedings IEEE INFOCOM '95, Vol. 1 (1995), pp. 394–401.

    Article  Google Scholar 

  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. 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.

    Article  Google Scholar 

  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. J. Whitehead, The Complexity of File Transfer Scheduling with Forwarding, SIAM Journal on Computing Vol. 19, No 2, April 1990, pp. 222–245.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of California, 93106, Santa Barbara, CA, USA

    Teofilo F. Gonzalez

Authors
  1. Teofilo F. Gonzalez
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alfonso Ferreira José Rolim Yousef Saad Tao Yang

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gonzalez, T.F. (1996). Multi-Message Multicasting. In: Ferreira, A., Rolim, J., Saad, Y., Yang, T. (eds) Parallel Algorithms for Irregularly Structured Problems. IRREGULAR 1996. Lecture Notes in Computer Science, vol 1117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030112

Download citation

  • DOI: https://doi.org/10.1007/BFb0030112

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61549-1

  • Online ISBN: 978-3-540-68808-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation