Skip to main content
SpringerLink
Log in

Network-aware distributed computing: A case study

  • Worshop on Run- Time Systems for Parallel Programming Matthew Haines, University or Wyoming, USA Koen Langendoen, Vrije Universiteit, The Netherlands Greg Benson, University of California at Davis, USA
  • Conference paper
  • First Online:
Parallel and Distributed Processing (IPPS 1998)

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

Included in the following conference series:

Abstract

The development of network-aware applications, i.e. applications that dynamically adapt to network conditions, has had some success in the domain of multimedia applications, but progress has been very slow for distributed computing applications. The reason is that the relationship between application performance and network performance is typically more complex for that class of applications, making adaptation difficult. In this paper we introduce two adaptation methods for distributed computing applications, one based on a performance model and another based on balancing computation and communication time. We illustrate the two methods using a simple distributed application (matrix multiply) and compare their performance. We show that both methods can correctly estimate the best number of nodes to use on our testbed. We also show that both methods have weaknesses. Model-based adaptation requires an accurate performance model and is sensitive to errors in measurements of the system parameters. The ratio-based method is more robust but less general.

This research was supported in part by the Advanced Research Projects Agency/ITO monitored by NRaD under contract N66001-96-C-8528.

Hongsuda Tangmunarunkit is currently a graduate student at USC.

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. J. Bolliger and Thomas Gross. A framework-based approach to the development of network-aware applications. Submitted for publication, 1997.

    Google Scholar 

  2. Jean-Chrysostome Bolot and Andres Vega-Garcia. Control mechanisms for packet audio in the internet. In IEEE INFOCOM'96, volume 1, pages,232–239, San Francisco, CA, March 1996. IEEE.

    Google Scholar 

  3. Robert Carter and Mark Crovella. Server selection using dynamic path characterization. In IEEE INFOCOM'97, volume 3, pages 8C–4, Kobe, Japan, April 1997. IEEE.

    Google Scholar 

  4. Tony DeWitt, Thomas Gross, Bruce Lowekamp, Nancy Miller, Peter Steenkiste, and Jaspal Subhlok. ReMoS: A Resource Monitoring System for Network Aware Applications. Technical Report CMU-CS-97-194, Carnegie Mellon University, December 1997.

    Google Scholar 

  5. R. Frederick. Network video(nv), 1993. Software availablevia ftp://ftp.parc.xerox.com/net-research.

    Google Scholar 

  6. V. Jacobson and S. McCanne. Visual audio tool (vat), 1993. Software available via ftp://ftp.ee.lbl.gov/conferencing/vat.

    Google Scholar 

  7. V. Jacobsonand S. McCanne. Vic, 1995. Software available via ftp://ftp.ee.lbl.gov/conferencing/vic.

    Google Scholar 

  8. Van Jacobson. Congestion Avoidance and Control. In Proceedings of the SIGCOMM '88 Symposium on Communications Architectures and Protocols, pages 314–329. ACM, August 1988.

    Google Scholar 

  9. H. Kanakia, P. Mishra, and A. Reibman. An adaptive congestion control scheme for real time packet video transport. IEEE/ACM Transactions on Networking, 3(6):671–682, December 1995.

    Article  Google Scholar 

  10. Brian Noble, M. Satyanarayanan, Dushyanth Narayanan, James Tilton, Jason Flinn, and Kevin Walker. Agile application-aware adaptation for mobility. In Proceedings of the Sixteenth Symposium on Operating System Principles, pages 276–287, October 1997.

    Google Scholar 

  11. Bruce Siegell and Peter Steenkiste. Automatic selection of load balancing parameters using compile-time and run-time information. Concurrency — Practice and Experience, 9(3):275–317, 1996.

    Article  Google Scholar 

  12. Jaspal Subhlok and Gary Vondran. Optimal latency-throughput tradeoffs for data parallel pipelines. In Proc. SPAA'96. ACM, June 1996.

    Google Scholar 

  13. Hongsuda Tangmunarunkit. Middleware for network-aware distributed computing applications. Undergraduate thesis, School of Computer Science, Carnegie Mellon University, May 1997.

    Google Scholar 

  14. Hideyuki Tokuda, Yoshito Tobe, Stephen Chou, and Jose Moura. Continuous Media Communication with Dynamic QOS Control Using ARTS with an FDDI Network. In Proceedings of the SIGCOMM '92 Symposium on Communications Architectures and Protocols, pages 88–98, Baltimore, August 1992. ACM.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Carnegie Mellon University, USA

    Hongsuda Tangmunarunkit & Peter Steenkiste

Authors
  1. Hongsuda Tangmunarunkit
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Steenkiste
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

José Rolim

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tangmunarunkit, H., Steenkiste, P. (1998). Network-aware distributed computing: A case study. In: Rolim, J. (eds) Parallel and Distributed Processing. IPPS 1998. Lecture Notes in Computer Science, vol 1388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64359-1_687

Download citation

  • DOI: https://doi.org/10.1007/3-540-64359-1_687

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64359-3

  • Online ISBN: 978-3-540-69756-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation