Higher SLA Satisfaction in Datacenters with Continuous Placement Constraints - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Master Thesis Year : 2013

Higher SLA Satisfaction in Datacenters with Continuous Placement Constraints

Abstract

In a virtualized datacenter, the Service Level Agreement for an application restricts the Virtual Machines (VMs) placement. An algorithm is in charge of maintaining a placement compatible with the stated constraints. Conventionally, when a placement algorithm computes a schedule of actions to re-arrange the VMs, the constraints ignore the intermediate states of the datacenter to only restrict the resulting placement. This situation may lead to temporary constraint violations. In this thesis, we present the causes of these violations. We then advocate for continuous placement constraints to restrict also the action schedule. We discuss why the development of continuous constraints requires more attention but how the extensible placement algorithm BtrPlace can address this issue.
Fichier principal
Vignette du fichier
thesis.pdf (789.67 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00932201 , version 1 (23-10-2014)

Identifiers

  • HAL Id : hal-00932201 , version 1

Cite

Tu Huynh Dang. Higher SLA Satisfaction in Datacenters with Continuous Placement Constraints. Operating Systems [cs.OS]. 2013. ⟨hal-00932201⟩
135 View
177 Download

Share

Gmail Facebook Twitter LinkedIn More