Main characteristics of large-scale, geographically distributed grid systems are resource heterogeneity and network latency. In this paper, we use queuing network models to analyze data-parallel grid applications and ...
详细信息
ISBN:
(纸本)9781424403431
Main characteristics of large-scale, geographically distributed grid systems are resource heterogeneity and network latency. In this paper, we use queuing network models to analyze data-parallel grid applications and we show the effects of resource heterogeneity, communications delays, network bandwidths and synchronization overheads on the application-level performance. the proposed models rely on the statistical pattern of computation, communication, and I/O operations in the parallel applications, as well as on measurable infrastructure characteristics. We finally show how the high variability in the execution and communication times must be considered when modeling applications on geographically distributed grid infrastructures.
Desktop grids use opportunistic sharing to exploit large collections of personal computers and workstations across the Internet, achieving tremendous computing power at low cost. Traditional desktop grid systems are t...
详细信息
ISBN:
(纸本)9781424403431
Desktop grids use opportunistic sharing to exploit large collections of personal computers and workstations across the Internet, achieving tremendous computing power at low cost. Traditional desktop grid systems are typically based on a client-server architecture, which has inherent shortcomings with respect to robustness, reliability and scalability. In this paper, we propose a decentralized, robust, highly available, and scalable infrastructure to match incoming jobs to available resources. through a comparative analysis on the experimental results obtained via simulation of three different types of matchmaking algorithms under different workload scenarios, we show the trade-offs between efficient matchmaking and good load balancing in a fully decentralized, heterogeneous computational environment.
the execution of workflow applications on the grid is a complex issue because of its dynamic and heterogeneous nature. While the grid provides good potential for achieving high performance, it also introduces a broad ...
详细信息
ISBN:
(纸本)9781424403431
the execution of workflow applications on the grid is a complex issue because of its dynamic and heterogeneous nature. While the grid provides good potential for achieving high performance, it also introduces a broad set of unpredictable overheads and possible failures. In this paper we present new methods for scalable and fault tolerant coordination of workflows in dynamic grid environments, including partitioning, static and dynamic optimisation, as well as Virtual Single Execution Environment, incorporated into the ASKALON distributed workflow Enactment Engine. We demonstrate the effectiveness of our methods on a material science workflow application executed in a real-world grid environment.
this paper studies the QoS-aware replica placement problem. Although there has been much work on replica placement problem, most of them concerns average system performance and ignores quality assurance issue. Quality...
详细信息
ISBN:
(纸本)9781424403431
this paper studies the QoS-aware replica placement problem. Although there has been much work on replica placement problem, most of them concerns average system performance and ignores quality assurance issue. Quality assurance is very important, especially in heterogeneous environments. We propose a new heuristic algorithm that determines the positions of replicas in order to satisfy the quality requirements imposed by data requests. the experimental results indicate that the proposed algorithm finds a near-optimal solution effectively and efficiently for algorithm can also adapt to various parallel and distributed environments.
In this paper we propose a systematic approach to performance analysis of workflow applications on the grid. We introduce an ideal model for the workflow execution time and explain the difference to the real measured ...
详细信息
ISBN:
(纸本)9781424403431
In this paper we propose a systematic approach to performance analysis of workflow applications on the grid. We introduce an ideal model for the workflow execution time and explain the difference to the real measured times based on a hierarchy of performance overheads for gridcomputing. We describe how to systematically measure and compute the overheads from individual activities to entire workflow applications. We adjusted well-known parallel processing metrics to the scope of gridcomputing, comprising speedup and efficiency. We have implemented and largely automatised our analysis approach in the context of the ASKALON grid application development and computing environment. We present experimental results that show detailed overhead analysis of two real-world workflow applications executed in a national grid environment.
In this work we report on data gathered via a deployment of a monitoring and benchmarking infrastructure on two production grid platforms, Teragrid and Geon. Our result show that these production grids are rather unav...
详细信息
ISBN:
(纸本)9781424403431
In this work we report on data gathered via a deployment of a monitoring and benchmarking infrastructure on two production grid platforms, Teragrid and Geon. Our result show that these production grids are rather unavailable, with success rates for benchmark and application runs between 55% and 80%. We also found that performance fluctuation was in the 50% range, expectedly mostly due to batch schedulers. We also investigate whether the execution time of a typical grid application can be predicated based on previous runs of simple benchmarks. Perhaps surprisingly, we find that application execution time can be predicted with a relative error as low as 9%.
In order to fulfill the complex resource requirements of some users in grid environments, support for coallocation between different resource providers is needed. Here, it is quite difficult to coordinate these differ...
详细信息
ISBN:
(纸本)9781424403431
In order to fulfill the complex resource requirements of some users in grid environments, support for coallocation between different resource providers is needed. Here, it is quite difficult to coordinate these different services from different resource providers, because a grid scheduler has to cope with different policies and objectives of the different resource providers and of the users. Agreement-based resource management is considered a feasible solution to solve many of these problems as it supports the reliable interaction between different providers and users. However, most current models do not well support co-allocation. Here, negotiation is needed to create such bi-lateral agreements between several grid parties. Such a negotiation process should be automated with no or minimal human interaction, considering the potential scale of grid systems and the amount of necessary transactions. therefore, strategic negotiation models play an important role. In this paper, a negotiation models which supports the co-allocation between different resource providers are proposed and examined. First simulations have been conducted to evaluate the presented system. the results demonstrate that the proposed negotiation model are suitable and effective for grid environments.
Desktop grids have proved to be a suitable platform for the execution of Bag-of-Tasks applications but, being characterized by a high resource volatility, require the availability of scheduling techniques able to effe...
详细信息
ISBN:
(纸本)9781424403431
Desktop grids have proved to be a suitable platform for the execution of Bag-of-Tasks applications but, being characterized by a high resource volatility, require the availability of scheduling techniques able to effectively deal with resource failures and/or unplanned periods of unavailability. In this paper we present a set of fault-aware scheduling policies that, rather than just tolerating faults as done by traditional fault-tolerant schedulers, exploit the information concerning resource availability to improve application performance. the performance of these strategies have been compared via simulation withthose attained by traditional fault-tolerant schedulers. Our results, obtained by consider a set of realistic scenarios modeled after real Desktop grids, show that our approach results in better application performance and resource utilization.
We describe an implementation based on the WS-Notification (WSN) specification for Publish/Subscribe communication which provides a distributed, content-based notification service. the implementation is based on a dis...
详细信息
ISBN:
(纸本)9781424403431
We describe an implementation based on the WS-Notification (WSN) specification for Publish/Subscribe communication which provides a distributed, content-based notification service. the implementation is based on a distributed hashtable (DHT) built on a structured overlay of peer nodes. the entire system acts as a notification broker, so that notification producers and consumers that make use of the network can achieve loosely-coupled communication with a decentralized, scalable service. We develop and evaluate self-optimizing behavior built to reduce notification traffic within the network.
暂无评论