Anticipating resource saturation in Federated Grids |
| |
Affiliation: | 1. Computer Laboratory, University of Cambridge, William Gates Building, 15 JJ Thompson Avenue, Cambridge CB3 0FD, United Kingdom;2. Department of Information Technologies and Communications, Universidad Politecnica de Cartagena (UPCT), Campus Muralla del Mar, Cartagena E-30202, Spain;1. Institute of Computer Science, University of Innsbruck, Austria;2. Departamento de Engenharia Informática, Universidade do Porto, Portugal;1. University of Amsterdam, Netherlands;2. Air France—KLM, France;3. i-Beleon, Netherlands |
| |
Abstract: | In a dynamic and geographically distributed Federated Grid where resources are shared between system participants, there is a lack of mechanisms capable of reallocating already scheduled tasks based on grid infrastructure owners’ current internal needs. In this paper we propose a set of policies for both, users and owners, that aid owners to satisfy internal peak demands and users to achieve the best makespan despite the circumstances. As in our previous work, the main purpose is to do so in the least intrusive way possible to maintain software stack independence of all participants, and to save time and communication bandwidth by anticipating grid resources saturation. These strategies suppose a novel approach for decentralized and non-cooperative workflow scheduling in a federation of heterogeneous grid infrastructures. We evaluate and prove the feasibility of our policies through a set of simulations that reflect the worst case where all resources are saturated. The results show that, in the worst scenario, our scheduling mechanism is beneficial to big infrastructure owners since they can achieve their own internal objectives, as well as to small users since they can reach the best possible completion time. |
| |
Keywords: | Resource sharing Performance model Decentralized Non-coordinated scheduling Federated Grids |
本文献已被 ScienceDirect 等数据库收录! |
|