A comparative study of multi-objective machine reassignment algorithms for data centres

DC FieldValueLanguage
dc.contributor.authorSaber, Takfarinas-
dc.contributor.authorGandibleux, Xavier-
dc.contributor.authorO'Neill, Michael-
dc.contributor.authorMurphy, Liam, B.E.-
dc.contributor.authorVentresque, Anthony-
dc.date.accessioned2019-11-08T16:01:08Z-
dc.date.available2019-11-08T16:01:08Z-
dc.date.copyright2019 Springeren_US
dc.date.issued2019-09-20-
dc.identifier.citationJournal of Heuristicsen_US
dc.identifier.issn1381-1231-
dc.identifier.urihttp://hdl.handle.net/10197/11192-
dc.description.abstractAt a high level, data centres are large IT facilities hosting physical machines (servers) that often run a large number of virtual machines (VMs)— but at a lower level, data centres are an intricate collection of interconnected and virtualised computers, connected services, complex service-level agreements. While data centre managers know that reassigning VMs to the servers that would best serve them and also minimise some cost for the company can potentially save a lot of money—the search space is large and constrained, and the decision complicated as they involve different dimensions. This paper consists of a comparative study of heuristics and exact algorithms for the Multi-objective Machine Reassignment problem. Given the common intuition that the problem is too complicated for exact resolutions, all previous works have focused on various (meta)heuristics such as First-Fit, GRASP, NSGA-II or PLS. In this paper, we show that the state-of-art solution to the single objective formulation of the problem (CBLNS) and the classical multi-objective solutions fail to bridge the gap between the number, quality and variety of solutions. Hybrid metaheuristics, on the other hand, have proven to be more effective and efficient to address the problem – but as there has never been any study of an exact resolution, it was difficult to qualify their results. In this paper, we present the most relevant techniques used to address the problem, and we compare them to an exact resolution ( -Constraints). We show that the problem is indeed large and constrained (we ran our algorithm for 30 days on a powerful node of a supercomputer and did not get the final solution for most instances of our problem) but that a metaheuristic (GeNePi) obtains acceptable results: more (+188%) solutions than the exact resolution and a little more than half (52%) the hypervolume (measure of quality of the solution set).en_US
dc.description.sponsorshipScience Foundation Irelanden_US
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.rightsThis is a post-peer-review, pre-copyedit version of an article published in Journal of Heuristics. The final authenticated version is available online at: http://dx.doi.org/10.1007/s10732-019-09427-8en_US
dc.subjectMachine reassignmenten_US
dc.subjectMetaheuristicsen_US
dc.subjectMulti-objectiveen_US
dc.titleA comparative study of multi-objective machine reassignment algorithms for data centresen_US
dc.typeJournal Articleen_US
dc.internal.authorcontactothertakfarinas.saber@ucd.ieen_US
dc.statusPeer revieweden_US
dc.check.date2020-03-24-
dc.identifier.doi10.1007/s10732-019-09427-8-
dc.neeo.contributorSaber|Takfarinas|aut|-
dc.neeo.contributorGandibleux|Xavier|aut|-
dc.neeo.contributorO'Neill|Michael|aut|-
dc.neeo.contributorMurphy|Liam, B.E.|aut|-
dc.neeo.contributorVentresque|Anthony|aut|-
dc.date.embargo2020-09-20en_US
dc.description.adminCheck for published version during checkdate report - ACen_US
dc.description.admin12 month embargo - ACen_US
dc.date.updated2019-09-23T08:23:31Z-
dc.identifier.grantid13/IA/1850-
dc.identifier.grantid13/RC/2094-
item.grantfulltextembargo_20200920-
item.fulltextWith Fulltext-
Appears in Collections:Computer Science Research Collection
Business Research Collection
PEL Research Collection
Files in This Item:
Access to this item has been restricted by the copyright holder until:2020-09-20
File Description SizeFormat 
saber2019JoH.pdf564.43 kBAdobe PDF    Request a copy
Show simple item record

Page view(s)

184
Last Week
9
Last month
checked on Jan 24, 2020

Download(s)

39
checked on Jan 24, 2020

Google ScholarTM

Check

Altmetric


This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.