Hierarchical resource allocation and consolidation framework in a multi-core server cluster using a Markov decision process model

This paper investigates a service level agreements (SLAs)-based resource allocation problem in a server cluster. The objective is to maximise the total profit, which is the total revenue minus the operational cost of the server cluster. The total revenue depends on the average request response time,...

Full description

Bibliographic Details
Main Authors: Pu Zhao, Xue Lin, Yanzhi Wang, Shuang Chen, Massoud Pedram
Format: Article
Language:English
Published: Wiley 2017-10-01
Series:IET Cyber-Physical Systems
Subjects:
Online Access:https://digital-library.theiet.org/content/journals/10.1049/iet-cps.2017.0060
id doaj-e90ac764b47841569f28fb04c668f88d
record_format Article
spelling doaj-e90ac764b47841569f28fb04c668f88d2021-04-02T15:30:17ZengWileyIET Cyber-Physical Systems2398-33962017-10-0110.1049/iet-cps.2017.0060IET-CPS.2017.0060Hierarchical resource allocation and consolidation framework in a multi-core server cluster using a Markov decision process modelPu Zhao0Xue Lin1Yanzhi Wang2Shuang Chen3Massoud Pedram4Northeastern UniversityNortheastern UniversitySyracuse UniversityUniversity of Southern CaliforniaUniversity of Southern CaliforniaThis paper investigates a service level agreements (SLAs)-based resource allocation problem in a server cluster. The objective is to maximise the total profit, which is the total revenue minus the operational cost of the server cluster. The total revenue depends on the average request response time, whereas the operating cost depends on the total energy consumption of the server cluster. A joint optimisation framework is proposed, comprised of request dispatching, dynamic voltage and frequency scaling (DVFS) for individual cores of the servers, as well as server- and core-level consolidations. Each DVFS-enabled core in the server cluster is modelled by using a continuous-time Markov decision process (CTMDP). A near-optimal solution comprised of a central manager and distributed local agents is presented. Each local agent employs linear programming-based CTMDP solving method to solve the DVFS problem for the corresponding core. On the other hand, the central manager solves the request dispatch problem and finds the optimal number of ON cores and servers, thereby achieving a desirable tradeoff between service response time and power consumption. To reduce the computational overhead, a two-tier hierarchical solution is utilized. Experimental results demonstrate the outstanding performance of the proposed algorithm over the baseline algorithms.https://digital-library.theiet.org/content/journals/10.1049/iet-cps.2017.0060contractsMarkov processesmultiprocessing systemsresource allocationpower aware computinglinear programmingcloud computinghierarchical resource allocation and consolidation frameworkmulticore server clusterservice level agreementsSLA-based resource allocation problemjoint optimisation frameworkdynamic voltage and frequency scalingrequest dispatchingDVFScontinuous-time Markov decision processlinear programming-based CTMDP solving methodtwo-tier hierarchical solutionrequest dispatch problemcloud computing
collection DOAJ
language English
format Article
sources DOAJ
author Pu Zhao
Xue Lin
Yanzhi Wang
Shuang Chen
Massoud Pedram
spellingShingle Pu Zhao
Xue Lin
Yanzhi Wang
Shuang Chen
Massoud Pedram
Hierarchical resource allocation and consolidation framework in a multi-core server cluster using a Markov decision process model
IET Cyber-Physical Systems
contracts
Markov processes
multiprocessing systems
resource allocation
power aware computing
linear programming
cloud computing
hierarchical resource allocation and consolidation framework
multicore server cluster
service level agreements
SLA-based resource allocation problem
joint optimisation framework
dynamic voltage and frequency scaling
request dispatching
DVFS
continuous-time Markov decision process
linear programming-based CTMDP solving method
two-tier hierarchical solution
request dispatch problem
cloud computing
author_facet Pu Zhao
Xue Lin
Yanzhi Wang
Shuang Chen
Massoud Pedram
author_sort Pu Zhao
title Hierarchical resource allocation and consolidation framework in a multi-core server cluster using a Markov decision process model
title_short Hierarchical resource allocation and consolidation framework in a multi-core server cluster using a Markov decision process model
title_full Hierarchical resource allocation and consolidation framework in a multi-core server cluster using a Markov decision process model
title_fullStr Hierarchical resource allocation and consolidation framework in a multi-core server cluster using a Markov decision process model
title_full_unstemmed Hierarchical resource allocation and consolidation framework in a multi-core server cluster using a Markov decision process model
title_sort hierarchical resource allocation and consolidation framework in a multi-core server cluster using a markov decision process model
publisher Wiley
series IET Cyber-Physical Systems
issn 2398-3396
publishDate 2017-10-01
description This paper investigates a service level agreements (SLAs)-based resource allocation problem in a server cluster. The objective is to maximise the total profit, which is the total revenue minus the operational cost of the server cluster. The total revenue depends on the average request response time, whereas the operating cost depends on the total energy consumption of the server cluster. A joint optimisation framework is proposed, comprised of request dispatching, dynamic voltage and frequency scaling (DVFS) for individual cores of the servers, as well as server- and core-level consolidations. Each DVFS-enabled core in the server cluster is modelled by using a continuous-time Markov decision process (CTMDP). A near-optimal solution comprised of a central manager and distributed local agents is presented. Each local agent employs linear programming-based CTMDP solving method to solve the DVFS problem for the corresponding core. On the other hand, the central manager solves the request dispatch problem and finds the optimal number of ON cores and servers, thereby achieving a desirable tradeoff between service response time and power consumption. To reduce the computational overhead, a two-tier hierarchical solution is utilized. Experimental results demonstrate the outstanding performance of the proposed algorithm over the baseline algorithms.
topic contracts
Markov processes
multiprocessing systems
resource allocation
power aware computing
linear programming
cloud computing
hierarchical resource allocation and consolidation framework
multicore server cluster
service level agreements
SLA-based resource allocation problem
joint optimisation framework
dynamic voltage and frequency scaling
request dispatching
DVFS
continuous-time Markov decision process
linear programming-based CTMDP solving method
two-tier hierarchical solution
request dispatch problem
cloud computing
url https://digital-library.theiet.org/content/journals/10.1049/iet-cps.2017.0060
work_keys_str_mv AT puzhao hierarchicalresourceallocationandconsolidationframeworkinamulticoreserverclusterusingamarkovdecisionprocessmodel
AT xuelin hierarchicalresourceallocationandconsolidationframeworkinamulticoreserverclusterusingamarkovdecisionprocessmodel
AT yanzhiwang hierarchicalresourceallocationandconsolidationframeworkinamulticoreserverclusterusingamarkovdecisionprocessmodel
AT shuangchen hierarchicalresourceallocationandconsolidationframeworkinamulticoreserverclusterusingamarkovdecisionprocessmodel
AT massoudpedram hierarchicalresourceallocationandconsolidationframeworkinamulticoreserverclusterusingamarkovdecisionprocessmodel
_version_ 1721559945145483264