Higher SLA Satisfaction in Datacenters with Continuous Placement Constraints

Tu Dang 1
1 OASIS - Active objects, semantics, Internet and security
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
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.
Document type :
Master thesis
Complete list of metadatas

Cited literature [37 references]  Display  Hide  Download

https://hal.inria.fr/hal-00932201
Contributor : Fabien Hermenier <>
Submitted on : Thursday, October 23, 2014 - 1:55:33 PM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM
Long-term archiving on : Saturday, January 24, 2015 - 10:05:31 AM

File

thesis.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00932201, version 1

Collections

Citation

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

Share

Metrics

Record views

210

Files downloads

260