Efficient and Robust Allocation Algorithms in Clouds under Memory Constraints

Olivier Beaumont 1, 2, * Lionel Eyraud-Dubois 1, 2 Juan-Angel Lorenzo 1, 2 Paul Renaud-Goud 3
* Auteur correspondant
1 Realopt - Reformulations based algorithms for Combinatorial Optimization
LaBRI - Laboratoire Bordelais de Recherche en Informatique, IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Abstract : 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.
Type de document :
Communication dans un congrès
IEEE International Conference on High Performance Computing (HiPC 2014), Dec 2014, Goa, India. IEEE, pp.12, 2014, Proceedings of the IEEE International Conference on High Performance Computing (HiPC 2014). 〈http://www.hipc.org/hipc2014/index.php〉
Liste complète des métadonnées

Littérature citée [20 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00874936
Contributeur : Olivier Beaumont <>
Soumis le : vendredi 12 décembre 2014 - 18:36:49
Dernière modification le : jeudi 11 janvier 2018 - 06:22:12
Document(s) archivé(s) le : mardi 11 avril 2017 - 02:17:18

Fichier

bare_conf-12pages.pdf
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

  • HAL Id : hal-00874936, version 2

Collections

Citation

Olivier Beaumont, Lionel Eyraud-Dubois, Juan-Angel Lorenzo, Paul Renaud-Goud. Efficient and Robust Allocation Algorithms in Clouds under Memory Constraints. IEEE International Conference on High Performance Computing (HiPC 2014), Dec 2014, Goa, India. IEEE, pp.12, 2014, Proceedings of the IEEE International Conference on High Performance Computing (HiPC 2014). 〈http://www.hipc.org/hipc2014/index.php〉. 〈hal-00874936v2〉

Partager

Métriques

Consultations de la notice

537

Téléchargements de fichiers

94