Skip to main content

Advertisement

Springer Nature Link
Log in

Broadcasting on Networks of Workstations

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

Broadcasting and multicasting are fundamental operations. In this work we develop algorithms for performing broadcast and multicast in clusters of workstations. In this model, sending a message to a machine in the same cluster takes 1 time unit, and sending a message to a machine in a different cluster takes C(≥1) time units. The clusters may have arbitrary sizes. Lowekamp and Beguelin proposed heuristics for this model, but their algorithms may produce broadcast times that are arbitrarily worse than optimal. We develop the first constant factor approximation algorithms for this model. Algorithm LCF (Largest Cluster First) for the basic model is simple, efficient and has a worst case approximation guarantee of 2. We then extend these models to more complex models where we remove the assumption that an unbounded amount of communication may happen using the global network. The algorithms for these models build on the LCF method developed for the basic problem. Finally, we develop broadcasting algorithms for the postal model where the sending node does not block for C time units when the message is in transit.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

References

  1. Bar-Noy, A., Kipnis, S.: Designing broadcast algorithms in the postal model for message-passing systems. Math. Syst. Theory 27(5), (1994)

  2. Bar-Noy, A., Guha, S., Naor, J.S., Schieber, B.: Message multicasting in heterogeneous networks. SIAM J. Comput. 30(2), 347–358 (2001)

    Article  MathSciNet  Google Scholar 

  3. Bhat, P.B., Raghavendra, C.S., Prasanna, V.K.: Efficient collective communication in distributed heterogeneous systems. J. Parallel Distrib. Comput. 63(3), 251–263 (2003)

    Article  MATH  Google Scholar 

  4. Bruck, J., Dolev, D., Ho, C., Rosu, M., Strong, R.: Efficient message passing interface(mpi) for parallel computing on clusters of workstations. Parallel Distrib. Comput. 40, 19–34 (1997)

    Article  Google Scholar 

  5. Culler, D.E., Karp, R.M., Patterson, D.A., Sahay, A., Schauser, K.E., Santos, E., Subramonian, R., von Eicken, T.: LogP: Towards a realistic model of parallel computation. In: Proceedings 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 1–12 (1993)

  6. Elkin, M., Kortsarz, G.: A combinatorial logarithmic approximation algorithm for the directed telephone broadcast problem. SIAM J. Comput. 35(3), 672–689 (2005)

    Article  MathSciNet  Google Scholar 

  7. Elkin, M., Kortsarz, G.: Sublogarithmic approximation for telephone multicast. J. Comput. Syst. Sci. 72(4), 648–659 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  8. Foster, I., Kesselman, K.: The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Mateo (1998)

    Google Scholar 

  9. Gropp, W., Lusk, E., Doss, N., Skjellum, A.: A high-performance, portable implementation of the mpi: a message passing interface standard. Parallel Comput. 22, 789–828 (1996)

    Article  MATH  Google Scholar 

  10. Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A survey of broadcasting and gossiping in communication networks. Networks 18, 319–349 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  11. Husbands, P., Hoe, J.C.: Mpi-start: delivering network performance to numerical applications. In: Supercomputing ’98: Proceedings of the 1998 ACM/IEEE Conference on Supercomputing (CDROM), pp. 1–15. Washington, DC, USA, 1998. IEEE Computer Society, Los Alamitos (1998)

    Google Scholar 

  12. Karp, R., Sahay, A., Santos, E., Schauser, K.E.: Optimal broadcast and summation in the LogP model. In: Proceedings of 5th Annual Symposium on Parallel Algorithms and Architectures, pp. 142–153 (1993)

  13. Kielmann, T., Bal, H., Gorlatch, S.: Bandwidth-efficient collective communication for clustered wide area systems. In: International Parallel and Distributed Processing Symposium, pp. 492–499. Washington, DC, USA, 2000. IEEE Computer Society, Los Alamitos (2000)

    Google Scholar 

  14. Kielmann, T., Hofman, R.F.H., Bal, H.E., Plaat, A., Bhoedjang, R.A.F.: Magpie: Mpiâs collective communication operations for clustered wide area systems. In: ACM SIGPLAN Notices, pp. 131–140 (1999)

  15. Lowekamp, B.B., Beguelin, A.: Eco: Efficient collective operations for communication on heterogeneous networks. In: International Parallel Processing Symposium (IPPS), pp. 399–405. Honolulu, HI (1996)

  16. Message passing interface forum. http://www.mpi-forum.org/index.html

  17. Patterson, D.A., Culler, D.E., Anderson, T.E.: A case for NOWs (networks of workstations). IEEE Micro 15(1), 54–64 (1995)

    Article  Google Scholar 

  18. Pruyne, J., Livny, M.: Interfacing condor and pvm to harness the cycles of workstation clusters. J. Future Gener. Comput. Syst. 12(1), 53–65 (1996)

    Article  Google Scholar 

  19. Richards, D., Liestman, A.L.: Generalization of broadcasting and gossiping. Networks 18, 125–138 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  20. Williams, T., Parsons, R.: Exploiting hierarchy in heterogeneous environments. In: IEEE/ACM IPDPS 2001, pp. 140–147. IEEE Press, New York (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Maryland, College Park, MD, 20742, USA

    Samir Khuller & Yung-Chun Justin Wan

  2. Department of Computer Science and Engineering, University of Connecticut, Storrs, CT, 06269, USA

    Yoo-Ah Kim

Authors
  1. Samir Khuller
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Yoo-Ah Kim
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Yung-Chun Justin Wan
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Yoo-Ah Kim.

Additional information

Research supported by NSF Award CCR-0113192.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Khuller, S., Kim, YA. & Wan, YC.J. Broadcasting on Networks of Workstations. Algorithmica 57, 848–868 (2010). https://doi.org/10.1007/s00453-008-9249-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-008-9249-0

Keywords