Efficient and Robust Allocation Algorithms in Clouds under Memory Constraints
| hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| dc.contributor.author | BEAUMONT, Olivier | |
| hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| dc.contributor.author | EYRAUD-DUBOIS, Lionel | |
| hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| dc.contributor.author | LORENZO, Juan-Angel | |
| hal.structure.identifier | Chalmers University of Technology [Göteborg] | |
| dc.contributor.author | RENAUD-GOUD, Paul | |
| dc.date.accessioned | 2024-04-04T02:17:08Z | |
| dc.date.available | 2024-04-04T02:17:08Z | |
| dc.date.created | 2014-05-28 | |
| dc.date.issued | 2014-12 | |
| dc.date.conference | 2014-12 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/189200 | |
| dc.description.abstractEn | We consider robust resource allocation of services in Clouds. More specifically, we consider the case of a large public or private Cloud platform such that a relatively small set of large and independent services accounts for most of the over-all CPU usage of the platform. We will show, using a recent trace from Google, that this assumption is very reasonable in practice. The objective is to provide an allocation of the services onto the machines of the platform, using replication in order to be resilient to machine failures. The services are characterized by their demand along several dimensions (CPU, memory,. . .) and by their quality of service require-ments, that have been defined through an SLA in the case of a public Cloud or fixed by the administrator in the case of a private Cloud. This quality of service defines the required robustness of the service, by setting an upper limit on the probability that the provider fails to allocate the required quantity of resources. This maximum probability of failure can be transparently turned into a set of (price, penalty) pairs. Our contribution is two-fold. First, we propose a formal model for this allocation problem, and we justify our as-sumptions based on an analysis of a publicly available clus-ter usage trace from Google. Second, we propose a resource allocation strategy whose complexity is low in the number of resources, what makes it well suited to large platforms. Finally, we provide an analysis of the proposed strategy through an extensive set of simulations, showing that it can be succesfully applied in the context of the Google trace. | |
| dc.description.sponsorship | Simulation de systèmes de prochaine génération - ANR-11-INFR-0013 | |
| dc.language.iso | en | |
| dc.publisher | IEEE | |
| dc.rights.uri | http://creativecommons.org/licenses/by/ | |
| dc.subject.en | resilience | |
| dc.subject.en | replication | |
| dc.subject.en | Cloud Computing | |
| dc.subject.en | resource allocation | |
| dc.subject.en | reliability | |
| dc.subject.en | column generation | |
| dc.subject.en | probability estimation | |
| dc.subject.en | Cloud | |
| dc.subject.en | failure | |
| dc.subject.en | service | |
| dc.subject.en | allocation | |
| dc.subject.en | bin packing | |
| dc.subject.en | linear program | |
| dc.subject.en | memory | |
| dc.subject.en | CPU | |
| dc.subject.en | large scale | |
| dc.subject.en | probability estimate | |
| dc.title.en | Efficient and Robust Allocation Algorithms in Clouds under Memory Constraints | |
| dc.type | Communication dans un congrès | |
| dc.subject.hal | Informatique [cs]/Calcul parallèle, distribué et partagé [cs.DC] | |
| bordeaux.page | 12 | |
| 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 | IEEE International Conference on High Performance Computing (HiPC 2014) | |
| bordeaux.country | IN | |
| bordeaux.conference.city | Goa | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-00874936 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.conference.end | 2014-12 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-00874936v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2014-12&rft.spage=12&rft.epage=12&rft.au=BEAUMONT,%20Olivier&EYRAUD-DUBOIS,%20Lionel&LORENZO,%20Juan-Angel&RENAUD-GOUD,%20Paul&rft.genre=unknown |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||