|
E-prints UPC >
Altres >
Enviament des de DRAC >
Empreu aquest identificador per citar o enllaçar aquest ítem:
http://hdl.handle.net/2117/13431
|
Ítem no disponible en accés obert per política de l'editorial
| Arxiu |
Descripció |
Mida | Format |
| LSI-11-7-R.pdf | | 462.74 kB | Adobe PDF |  |
|
| Citació: | Berral, J.; Gavaldà, R.; Torres, J. Adaptive scheduling on power-aware managed data-centers using machine learning. A: IEEE/ACM International Conference on Grid Computing. "12th IEEE/ACM International Conference on Grid Computing (GRID 2011)". Lyon: IEEE Computer Society Publications, 2011, p. 66-73. |
| Títol: | Adaptive scheduling on power-aware managed data-centers using machine learning |
| Autor: | Berral García, Josep Lluís ; Gavaldà Mestre, Ricard ; Torres Viñals, Jordi  |
| Editorial: | IEEE Computer Society Publications |
| Data: | 2011 |
| Tipus de document: | Conference report |
| Resum: | Energy-related costs have become one of the major economic factors in IT data-centers, and companies and the research community are currently working on new efficient
power-aware resource management strategies, also known as “Green IT”. Here we propose an autonomic scheduling of tasks and web-services over cloud environments, focusing on the profit optimization by executing a set of tasks according to servicelevel agreements minus its costs like power consumption. The principal contribution is the use of machine learning techniques in order to predict a priori resource usages, like CPU consumption, and estimate the tasks response time based on
the monitored data traffic characteristics. Further, in order to optimize the scheduling, an exact solver based on mixed integer linear programming is used as a proof of concept, and also compared to some approximate algorithm solvers to find valid
alternatives for the NP-hard problem of exact schedule solving.
Experiments show that machine learning algorithms can predict system behaviors with acceptable accuracy, also the ILP solver
obtains the optimal solution managing to adjust appropriately the schedule according to profits and cost of power increases, also
reducing migrations when their cost is taken into consideration.
Finally, is demonstrated that one of the approximate algorithm solvers is much faster but close in terms of the optimization goal
to the exact solver. |
| ISBN: | 978-0-7695-4572-6 |
| URI: | http://hdl.handle.net/2117/13431 |
| Versió de l'editor: | 10.1109/Grid.2011.18 |
| Apareix a les col·leccions: | Altres. Enviament des de DRAC Departament de Llenguatges i Sistemes Informàtics. Ponències/Comunicacions de congressos Departament d'Arquitectura de Computadors. Ponències/Comunicacions de congressos CAP - Grup de Computació d´Altes Prestacions. Ponències/Comunicacions de congressos LARCA - Laboratori d´Algorísmia Relacional, Complexitat i Aprenentatge. Ponències/Comunicacions de congressos
|
| Comparteix: |
|
Queda prohibida la reproducció, transformació, distribució i comunicació pública d'aquesta obra. Es permet, en tot cas, la reproducció per a ús privat sempre i quan la còpia que se'n faci no sigui objecte d'utilització col·lectiva ni lucrativa (art. 31.2 del Reial Decret Legislatiu 1/1996, de 12 d'abril, pel qual s'aprova el Text Refós de la Llei de Propietat Intel·lectual, http://bibliotecnica.upc.es/sepi/legislacio.asp).
Per a qualsevol ús que es vulgui fer diferent al permès, dirigiu-vos a: sepi@upc.edu
|