Column generation integer programming for allocating jobs with periodic demand variations - Archive ouverte HAL Access content directly
Conference Papers Year :

Column generation integer programming for allocating jobs with periodic demand variations

(1, 2) , (1)
1
2

Abstract

In the context of service hosting in large-scale datacenters, we consider the problem faced by a provider for allocating services to machines. An analysis of a public Google trace corresponding to the use of a production cluster over a long period shows that long-running services experience demand variations with a periodic (daily) pattern, and that services with such a pattern account for most of the overall CPU demand. This leads to an allocation problem where the classical Bin-Packing issue is augmented with the possibility to co-locate jobs whose peaks occur at different times of the day, which is bound to be more efficient than the usual approach that consist in over-provisioning for the maximum demand. In this paper, we propose a column-generation approach to solving this problem, where the subproblem uses a sophisticated SOCP (Second Order Cone Program) formulation. This allows to explicitely select jobs which benefit from being co-allocated together. Experimental results comparing with theoretical lower bounds and with standard packing heuristics shows that this approach is able to provide very efficient assignments in reasonable time.
Fichier principal
Vignette du fichier
ALGOCLOUD_2015_Ikbel BELAID.pdf (315.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01252770 , version 1 (08-01-2016)

Identifiers

  • HAL Id : hal-01252770 , version 1

Cite

Ikbel Belaid, Lionel Eyraud-Dubois. Column generation integer programming for allocating jobs with periodic demand variations. International Workshop on Algorithmic Aspects of Cloud Computing, Sep 2015, Patras, Greece. ⟨hal-01252770⟩
206 View
257 Download

Share

Gmail Facebook Twitter LinkedIn More