A LAUNCH-TIME SCHEDULING HEURISTICS FOR PARALLEL APPLICATIONS ON WIDE AREA GRIDS

Large and dynamic computational Grids, generally known as wide-area Grids, are characterized by a large availability, heterogeneity on computational resources, and high variability 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 computational 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