Towards high-level SLAs with heterogeneous workloads: job resource requirements prediction for deadline schedulers
Jornadas09r.pdf (699,1Kb) (Restricted access) Request copy
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
Document typeConference report
Rights accessRestricted access - publisher's policy
Cloud users want to express their requirements in terms of high-level metrics (e.g. in terms of execution time, not in terms of CPU MHz). Moreover, at the submission time they would like to know if the resource provider will ful l with their requirements in order to decide if they would rather prefer another provider. On the other hand, the resource provider have to translate these high-level metrics into hard- ware related metrics, to know if he have enough resources to execute the user's requests. In this context, we present our prediction system to foresee the amount of CPU required for a job to nish before its deadline. This prediction system uses machine learning techniques to learn about the jobs and on-line adjust itself. Before all this training is done, the Prediction System uses an analytical model for this purpose. We also contribute with a deadline-based scheduler which uses these predictions to discard jobs that will not meet its deadline in order to maximize the provider's revenue by means of a dynamic and effi cient resource allocation to jobs. We show how our system is able to provide higher revenue to resource providers compared to simple yet well known schedulers like EDF, SJF, etc.
CitationReig, G.; Alonso, J.; Guitart, J. Towards high-level SLAs with heterogeneous workloads: job resource requirements prediction for deadline schedulers. A: Jornadas de Paralelismo. "XX Jornadas de Paralelismo". A Coruña: 2009, p. 653-657.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder