Allocating jobs with periodic demand variations
hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
dc.contributor.author | BEAUMONT, Olivier | |
hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
dc.contributor.author | BELAID, Ikbel | |
hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
dc.contributor.author | EYRAUD-DUBOIS, Lionel | |
hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
dc.contributor.author | LORENZO-DEL-CASTILLO, Juan-Angel | |
dc.date.accessioned | 2024-04-04T03:18:57Z | |
dc.date.available | 2024-04-04T03:18:57Z | |
dc.date.issued | 2015-07-25 | |
dc.date.conference | 2015 | |
dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/194458 | |
dc.description.abstractEn | In the context of service hosting in large-scale datacenters, we consider the problem faced by a provider for allocating services to machines. Based on an analysis of a public Google trace correspond-ing to the use of a production cluster over a long period, we propose a model where long-running services experience demand variations with a periodic (daily) pattern and we prove that services following this model acknowledge for most of the overall CPU demand. This leads to an allo-cation problem where the classical Bin-Packing issue is augmented with the possibility to co-locate jobs whose peaks occur at different times of the day, which is bound to be more efficient than the usual approach that consist in over-provisioning for the maximum demand. In this paper, we provide a mathematical framework to analyze the packing of services exhibiting daily patterns and whose peaks occur at different times. We propose a sophisticated SOCP (Second Order Cone Program) formula-tion for this problem and we analyze how this modified packing constraint changes the behavior of standard packing heuristics (such as Best-Fit or First-Fit Decreasing). We show that taking periodicity of demand into account allows for a substantial improvement on machine utilization in the context of large-scale, state-of-the-art production datacenters. | |
dc.description.sponsorship | Simulation de systèmes de prochaine génération - ANR-11-INFR-0013 | |
dc.language.iso | en | |
dc.title.en | Allocating jobs with periodic demand variations | |
dc.type | Communication dans un congrès | |
dc.identifier.doi | 10.1007/978-3-662-48096-0_12 | |
dc.subject.hal | Informatique [cs]/Calcul parallèle, distribué et partagé [cs.DC] | |
bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
bordeaux.institution | Université de Bordeaux | |
bordeaux.institution | Bordeaux INP | |
bordeaux.institution | CNRS | |
bordeaux.conference.title | Euro-Par 2015 | |
bordeaux.country | AT | |
bordeaux.conference.city | Vienna | |
bordeaux.peerReviewed | oui | |
hal.identifier | hal-01118176 | |
hal.version | 1 | |
hal.invited | non | |
hal.proceedings | oui | |
hal.conference.organizer | Träff, Jesper Larsson, Hunold, Sascha, Versaci, Francesco | |
hal.popular | non | |
hal.audience | Internationale | |
hal.origin.link | https://hal.archives-ouvertes.fr//hal-01118176v1 | |
bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2015-07-25&rft.au=BEAUMONT,%20Olivier&BELAID,%20Ikbel&EYRAUD-DUBOIS,%20Lionel&LORENZO-DEL-CASTILLO,%20Juan-Angel&rft.genre=unknown |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |