On the Influence of Network Characteristics on Application Performance in the Grid Environment

  • Yoshinori Kitatsuji
  • Satoshi Katsuno
  • Katsuyuki Yamazaki
  • Hiroshi Koide
  • Masato Tsuru
  • Yuji Oie
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3420)

Abstract

In the Grid computing, it is a key issue how limited network resources are effectively shared by communications of various applications in order to improve the application-level performance, e.g., to reduce the completion time of each application and/or a set of applications. In fact, the communication of an application changes the condition of network resources, which may, in turn, affect the communications in other applications, and thus may deteriorate their performance. In this paper, we examine the characteristics of traffic generated by some typical grid applications, and how the round-trip time and the bottleneck bandwidth affect the application-level performance (i.e., completion time) of these applications. Our experiments show that the impact of network conditions on the application performance and the impact of application traffic on the network conditions are considerably different depending on the application. Those results suggest an effective network resource allocation should take network-related properties of individual applications into consideration.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Foster, I., Kesselman, C.: The GRID Blueprint for a New Computing Infrastructure. Morgan Kaufmann Publishers, San Francisco (1998)Google Scholar
  2. 2.
    Foster, I., Kesselman, C., Tuecke, S.: The Anatomy of the Grid: Enabling Scalable Virtual Organizations. International Journal of Supercomputer Applications 15(3), 200–222 (2001)CrossRefGoogle Scholar
  3. 3.
    Elwalid, A., Jin, C., Low, S., Widjaja, I.: MATE: MPLS adaptive traffic engineering. In: Proc. of the Infocom Anchorage, pp. 1300–1309 (2001)Google Scholar
  4. 4.
    Guven, T., Kommareddy, C., La, R., Shayman, M., Bhattacharjee, S.: Measurement Based Optimal Multi-path Routing. In: Proc. of the Infocom, Hong Kong (March 2004)Google Scholar
  5. 5.
    ICPC Asia Regional Contest, Japan Hakodate, http://www.fun.ac.jp/icpc/
  6. 6.
    Kasahara Laoratory, Waseda University, http://www.kasahara.elec.waseda.ac.jp/schedule
  7. 7.
    Koide, H., Oie, Y.: A New Task Scheduling Method for Distributed Programs which Require Memory Management in Grids. In: Proc. Proposed SAINT 2004 Workshop 8: High Performance Grid Computing and Networking, Tokyo, pp. 666–673 (2004)Google Scholar
  8. 8.
    Buyya, R.: High Performance Cluster Computing: Programming and Applications, vol. 2. Prentice Hall PTR, Englewood Cliffs (1999)Google Scholar
  9. 9.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Yoshinori Kitatsuji
    • 1
  • Satoshi Katsuno
    • 2
  • Katsuyuki Yamazaki
    • 2
  • Hiroshi Koide
    • 3
  • Masato Tsuru
    • 3
  • Yuji Oie
    • 3
  1. 1.NICT Kitakyushu JGN2 Research CenterKitakyushu–shi, FukuokaJapan
  2. 2.KDDI R&D Laboratories, Inc.SaitamaJapan
  3. 3.Kyushu Institute of TechnologyFukuokaJapan

Personalised recommendations