A Launch-time Scheduling Heuristics for Parallel Applications on Wide Area Grids |
| |
Authors: | Ranieri Baraglia Renato Ferrini Nicola Tonellotto Laura Ricci Ramin Yahyapour |
| |
Affiliation: | 1. Information Science and Technologies Institute, ISTI-CNR, Via G. Moruzzi 1, Pisa, Italy 2. Department of Computer Science, University of Pisa, Largo B. Pontecorvo 3, Pisa, Italy 3. Institute for Robotics Research, University of Dortmund, Otto-Hahn Stra?e 8, Dortmund, Germany
|
| |
Abstract: | Large and dynamic computational Grids, generally known as wide-area Grids, are characterized by a large availability, heterogene- ity on computational resources, and high vari- ability on their status during the time. Such Grid infrastructures require appropriate schedule mechanisms in order to satisfy the application performance requirements (QoS). In this paper we propose a launch-time heuristics to schedule component-based parallel applications on such kind of Grid. The goal of the proposed heuristics is threefold: to meet the minimal task computation- al requirement, to maximize the throughput between communicating tasks, and to evaluate on-the-fly the resource availability to minimize the aging effect on the resources state. We evaluate the proposed heuristics by simulations applying it to a suite of task graphs and Grid platforms randomly generated. Moreover, a further test was conducted to schedule a real application on a real Grid. Experimental results shown that the proposed solution can be a viable one. |
| |
Keywords: | Grid computing Wide-area Grids Performance requirements Static scheduling Quality of service |
本文献已被 SpringerLink 等数据库收录! |
|