Lower Bounds for the Duration of Decommission Operations with Relaxed Fault Tolerance in Replication-based Distributed Storage Systems - Université de Rennes Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2018

Lower Bounds for the Duration of Decommission Operations with Relaxed Fault Tolerance in Replication-based Distributed Storage Systems

Bornes Inférieures pour les Temps de Décommission dans les Systèmes de Stockage Distribués basés sur la Réplication lorsque la Tolérance aux Pannes est Relachée

Résumé

Efficient resource utilization is a major concern for large-scale computer platforms. One method used to lower energy consumption and operational cost is to reduce the amount of idle resources. This can be achieved by using malleability, namely, the possibility for resource managers to dynamically increase or decrease the amount of resources of jobs while they are running. Decommissioning (removing from the cluster) the idle nodes as soon as possible allows the resource man- ager to quickly reallocate the nodes to other jobs. Challenges appear when such nodes host part of a dis- tributed storage system. Indeed, distributed storage systems need to transfer large amounts of data during decommission in order to ensure data availability and a constant level of fault tolerance. In this paper, we explore the possibility of relaxing the level of fault tolerance during the decommission in order to reduce the amount of data transfers needed before nodes are released, and thus return nodes to the resource manager faster. We quantify theoretically how much time and resources are saved by such a a fast decommission strategy compared with a standard decommission. We establish lower bounds for the duration of the different phases of a fast decommission. We use the lower bounds to estimate when the fast decommission would be useful to reduce the usage of core-hours. We implement a prototype of fast decommission mechanism. Using the prototype, we validate the lower bounds on the duration of the operation and confirm the findings about the core-hour usage.
Dans ce rapport, nous modélisons la durée de la décommission de noeuds d’un système de stockage distribué basé sur la réplication lorsque la contrainte de tolérance aux pannes est relachée. Une borne inférieure pour chaque phase de l’opération est obtenue. Une implémentation du mécanisme dans Pufferbench permet de valider les résultats théoriques. Cette méthode de décommission est par nature peu sure, et nous montrons que des gains ne sont obtenus que dans le cas d’un système limité par la bande passante du réseau.
Fichier principal
Vignette du fichier
Report.pdf (677.67 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01943964 , version 1 (04-12-2018)
hal-01943964 , version 2 (06-12-2018)

Identifiants

  • HAL Id : hal-01943964 , version 2

Citer

Nathanaël Cheriere, Matthieu Dorier, Gabriel Antoniu. Lower Bounds for the Duration of Decommission Operations with Relaxed Fault Tolerance in Replication-based Distributed Storage Systems. [Research Report] RR-9229, Inria Rennes - Bretagne Atlantique. 2018, pp.1-28. ⟨hal-01943964v2⟩
247 Consultations
85 Téléchargements

Partager

Gmail Facebook X LinkedIn More