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

  title={On the Influence of Network Characteristics on Application Performance in the Grid Environment},
  author={Yoshinori Kitatsuji and Satoshi Katsuno and Katsuyuki Yamazaki and Hiroshi Koide and Masato Tsuru and Yuji Oie},
  booktitle={Information-Centric Networking},
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… 

Performance models for hierarchical grid architectures

This paper uses queuing network models to analyze data-parallel grid applications and shows how the high variability in the execution and communication times must be considered when modeling applications on geographically distributed grid infrastructures.

Performance control of internet-based engineering applications.

Thanks to technologies able to simplifying the integration among remote programs hosted by different organizations, engineering and scientific communities are embodying service oriented architectures

Dynamic Local Scheduling of Multiple DAGs in Distributed Heterogeneous Systems

The aim of this article is to present the dynamic (on-line) algorithm which schedules multiple DAG applications without any central node and the schedule is created only with the knowledge of node's network neigbourhood.



Network monitoring for GRID performance optimization

The effect of packet reordering in a backbone link on application throughput

The results show that only a small percentage of reordered packets, by at least three packet locations, in a backbone link can cause significant degradation of application throughput, and long flows are affected most.

Dynamic distance maps of the Internet

  • W. TheilmannK. Rothermel
  • Computer Science
    Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)
  • 2000
This paper presents an approach to creating a global view on the Internet, a so-called network distance map, which realizes a hierarchical decomposition of the network into regions and which allows us to estimate the network distance between any two hosts.

Using Effective Network Views to Promote Distributed Application Performance

In this paper, we show that distributed parallel application performance in clusters of workstations benefits from knowledge about network topology in cases where LAN resources can become potential

Dynamically forecasting network performance using the Network Weather Service

  • R. Wolski
  • Computer Science
    Cluster Computing
  • 2004
The Network Weather Service is a generalizable and extensible facility designed to provide dynamic resource performance forecasts in metacomputing environments and its design and predictive performance are outlined.

Sensitivity of parallel applications to large differences in bandwidth and latency in two-layer interconnects

This paper studies application performance on systems with strongly non-uniform remote memory access, and finds that for gaps larger than those of current generation NUMAs, performance suffers considerably (for applications that were designed for a uniform access interconnect).

Topology discovery in heterogeneous IP networks

Novel algorithms for discovering physical topology in heterogeneous (i.e., multi-vendor) IP networks are presented, which rely on standard SNMP MIB information that is widely supported by modern IP network elements and require no modifications to the operating system software running on elements or hosts.

MATE: MPLS adaptive traffic engineering

  • A. ElwalidCheng JinS. LowI. Widjaja
  • Computer Science, Business
    Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213)
  • 2001
An analytical model is presented, derives a class of MATE algorithms, and proves their convergence, and several practical design techniques to implement MATE are described.

The Anatomy of the Grid: Enabling Scalable Virtual Organizations

  • Ian T Foster
  • Computer Science
    Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid
  • 2001
The authors present an extensible and open Grid architecture, in which protocols, services, application programming interfaces, and software development kits are categorized according to their roles in enabling resource sharing.

Using loss pairs to discover network properties

Using loss pairs, it is shown that it is possible to characterize the packet dropping behavior of drop-tail and AQM routers internal to the network, from measurements made at end systems.