<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Heterogeneous Job Consolidation for Power Aware Scheduling with Quality of Service *</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Fermin Armenta-Cano</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andrei Tchernykh</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jorge M. Cortés-Mendoza</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ramin Yahyapour</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Alexander Yu. Drozdov</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Pascal Bouvry</string-name>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Dzmitry Kliazovich</string-name>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Arutyun Avetisyan</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>CICESE Research Center</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>GWDG - University of Göttingen</institution>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Moscow Institute of Physics and Technology</institution>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>University of Luxembourg</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2015</year>
      </pub-date>
      <fpage>687</fpage>
      <lpage>697</lpage>
      <abstract>
        <p>In this paper, we present an energy optimization model of Cloud computing, and formulate novel energy-aware resource allocation problem that provides energy-efficiency by heterogeneous job consolidation taking into account types of applications. Data centers process heterogeneous workloads that include CPU intensive, disk I/O intensive, memory intensive, network I/O intensive and other types of applications. When one type of applications creates a bottleneck and resource contention either in CPU, disk or network, it may result in degradation of the system performance and increasing energy consumption. We discuss energy characteristics of applications, and how an awareness of their types can help in intelligent allocation strategy to improve energy consumption.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
    </sec>
    <sec id="sec-2">
      <title>2. Related work</title>
      <p>Reducing energy consumption in Cloud computing has emerged as one the main research issues both
in industry and academia. This is due to the fact that the energy required by the datacenters for its
operation, power supply, and cooling, contribute significantly to the total operational costs.</p>
      <p>In this section, we discuss power aware resource allocation algorithms presented in the literature.
EMVM- Energy-aware resource allocation heuristics for efficient management [2]. The authors
define an architectural framework and principles for energy-efficient Cloud computing. They present
resource provisioning and allocation algorithms utilizing the dynamic consolidation of VMs for
energy-efficient management of Cloud computing environments. The approach is validated by
conducting a performance evaluation study using the CloudSim toolkit. It is shown that the approach
leads to a substantial reduction of energy consumption in Cloud data centers in comparison to static
resource allocation techniques.</p>
      <p>Presented power consumption model is the following.
where is the maximum power consumed when the server is fully utilized; is the fraction of
power consumed by the idle server (i.e. 70%); and is the CPU utilization.</p>
      <p>The total energy consumption is defined as an integral of the power consumption function over
a given period of time</p>
      <p>When VMs do not use all provided resources, they can be logically resized and consolidated to
the minimum number of physical nodes. While idle nodes can be switched to the sleep mode to
eliminate the idle power consumption and reduce the total energy consumption by the data center.</p>
      <p>Fig. 1 shows the percentage of energy consumption due to CPU utilization used in this work.
y
g
r
en n
fe ito
o p
e m
tga su
cen cno
r
e
p
100%
90%
80%
70%
60%</p>
      <p>HSFL- Hybrid shuffled frog leaping algorithm [3]. The authors propose a data center resource
management scheme. It can not only guarantee user quality of service (QoS) specified by SLAs, but
also achieve maximum energy saving and green computing goals. Consolidation of resources is
achieved by VM migrations technology. Low utilized and idle hosts are switched to power saving
mode to achieve energy saving while ensuring that SLAs are adhered to.</p>
      <p>Host energy consumption exhibits an almost linear proportion to CPU energy consumption.
Moreover, the energy consumption of an idle host accounts for 70% of full-load operation energy
consumption. The energy consumed by VM migrations also requires consideration. Energy
consumption within a given unit time is defined as follows</p>
      <p>is the energy consumption when host is in full load. is the average utilization
rate of the host processor within unit time, is the collection of VM migrations within the unit time
window, and is the migration time of VM . The percentage of energy consumption due to CPU
utilization is similar to Fig. 1.</p>
      <p>AETC- Algorithm of energy-aware task consolidation [4]. The authors propose a technique of
energy-aware task consolidation (ETC) to minimize energy consumption. ETC restricts CPU use
below a specified peak threshold by consolidating tasks amongst virtual clusters. In addition, the
energy cost model considers network latency, when a task migrates to another virtual cluster. They
define a default CPU utilization threshold of 70% to demonstrate task consolidation management
amongst virtual clusters. Although the idle state of virtual machines and network transmission are
assumed to be a constant ratio of basic energy consumption unit in his study. The simulation results
show that ETC can significantly reduce power consumption when managing task consolidation for
Cloud systems. ETC is designed to work in a data center for VMs that reside on the same rack or on
racks where network bandwidth is relatively constant.</p>
      <p>y
g
r
en n
e io
f t
o p
e m
tga su
cen cno
r
e
p</p>
      <p>The model assumes energy consumption in the idle state. An additional energy β
is required for executing tasks when CPU utilization is increased.</p>
      <p>The energy consumption of a virtual machine is defined as follows. The total energy
consumption of during the time period is given the following formula:</p>
      <p>Given a virtual cluster, which consists of
time period tm is as follows:</p>
      <p>VMs, the energy consumption of VC during the
Fig. 2 shows the percentage of energy consumption due to CPU utilization.</p>
      <p>CTES- Cooperative Two-Tier Energy-Aware Scheduling [5]. The authors propose a cooperative
two-tier task scheduling approach to benefit both Cloud providers and their customers. It regulates the
execution speeds of real-time tasks in a way that a host reaches the optimum level of utilization
instead of migrating its tasks to other hosts. They also propose several predictive global task
scheduling policies to map arrived tasks to feasible VM, in his technique, a host is locally scheduled to
reach its optimum CPU usage instead of migrating its tasks to other hosts. They divide the energy
consumption of a host into two parts, static and dynamic energies. His simulation results show that the
proposed task scheduling approach reduces the total energy consumption of a Cloud.</p>
      <p>The utilization of a host,
is defined as:
, where
are the allocated MIPS of
in time and is the maximum computing power of</p>
      <p>We suppose that an idle host changes its state to be powered off immediately. Thus, the total
power of a host is defined as:
is the power consumed during the idle time of a computing node. It is defined as
. is the power consumed when a host works with its maximum utilization. Utilization.
is the constant ratio of the static power of a host to its maximum power which depends
on the physical characteristics of a host.</p>
      <p>Dynamic power consumption is:</p>
      <p>If the system uses the power , the energy consumption will be where
is the time in which a host works at its maximum computing power to finish a certain number of
instructions. The percentage of energy consumption due to CPU utilization is similar to Fig. 1.</p>
      <p>Therefore, the energy consumption of a host to finish its certain amount of instructions is obtained
by:</p>
      <p>DVMA- A Decentralized Virtual Machine Migration Approach [6]. The authors propose a
decentralized virtual machine migration approach inside the data centers for Cloud computing
environments which use virtual machines to host many third-party applications. They define a system
models and power models then; they present the key steps of the decentralized mechanism, including
the establishment of load vectors, load information collection, VM selection, and destination
determination. A two-threshold decentralized migration algorithms is implemented to further save the
energy consumption as well as keeping the quality of services. Performance evaluation results of their
simulation experiments illustrate that their approach can achieve better load balancing effect and less
power consumption than other strategies.</p>
      <p>An idle physical node even with 0% of utilization could still consume a plenty of power. Let α be
the fraction of power consumed by an idle node compared to a full utilized node and  the current
CPU utilization of the node. Then, we use the power model defined as follows to compute the power
consumption of a physical nodes : , where is the
power consumption of when it is fully utilized (i.e., it reaches 100% of CPU utilization). The
percentage of energy consumption due to CPU utilization is similar to Fig. 1.</p>
      <p>EDRP- Energy and Deadline Aware Resource Provisioning [7]. The authors addresses the
problem of minimizing the operation cost of a Cloud system by maximizing its energy efficiency
while ensuring that user deadlines as defined in Service Level Agreements are met. They take into
account two types of workload models, independent batch requests and task graphs with dependencies.</p>
      <p>The power consumption of at time includes the static power consumption and the
dynamic power consumption . Both are correlated with the utilization rate of at time :
. We evaluate by considering only the CPU requirements of the hosted VMs indicated
in , and do not differentiate between VMs that are running tasks and idle VMs, since
background CPU activities are needed even during idle periods. is constant when
, 0 otherwise. The relationship between and is much more complex. Servers
have optimal utilization levels in terms of performance-per-watt, which we define as for . It is
commonly accepted that for modern servers , and the increase in power consumption
beyond this operating point is more drastic than when . Even for identical utilization
levels, the energy efficiency of different servers may vary. This is captured by the coefficients and
, representing the power consumption increase of when and
respectively. is then calculated as:</p>
      <p>We would like to point out that the exact formulations of
analysis, since its increment is faster when than when
do not undermine the</p>
      <p>.
Suppose the upper bound of the maximum schedule length of all applications is . The total
energy consumption (COSP) is the sum of the power consumption across all servers throughout the
operation timeline:</p>
      <p>In Fig. 3, we show the nonlinear percentage of energy consumption due to CPU utilization used in
this work.</p>
      <p>100%
rgy 95%
en n 90%
fe ito 85%
o p 80%
e m
tga su 75%
n no 70%
ce c 65%
reP 60%</p>
      <p>BFDP- Best Fit Decreasing Power [8]. The authors propose a simulation-driven methodology
with an energy model based on polynomial regression with Lasso to predict energy consumption to
verify its performance, and a resource scheduling algorithm BFDP shifting its optimization goal from
resource consolidation to power consumption to improve the energy efficiency without degrading the
QoS of the system and they consider four type of jobs, CPU-intensive, Memory-intensive,
Networkintensive and I/O-intensive. The authors introduced the mechanism of utilization thresholds in BFDP
to alleviate the over-consolidation issue in the Best-Fit strategy. Their results showed that are effective
because BFDP creates less SLA violations than the BFDR in light workloads.</p>
      <p>The authors uses a nonlinear energy model:
where is the kernel function of expression , is the CPU and memory utility. is the
parameter of the kernel function to be determined through the model training process. is a constant.
Fig. 4 presents a relationship between CPU and memory utilization and full-system power.</p>
      <p>PAHD- Power-aware Applications Hybrid Deployment [9]. The authors present I/O Intensive and
CPU-Intensive applications hybrid deployment to optimize resource utilization within virtualization
environments. To demonstrate the problem of I/O and CPU resource in virtualization environment,
they use Xen as the Virtual Machine Monitor to make experiments. Under different resource
allocation configurations, they evaluate power efficiency up to 2%12%, compared to the default
deployment. Finally they conclude that if the CPU-Intensive application is allocated twice as much
CPU compared to I/O-Intensive application, there are an improvement in the power efficiency.</p>
      <p>Table 1 shows the summary of the algorithm domains, the main characteristics of described
algorithms, and the criteria used to evaluate quality of the algorithms.</p>
      <sec id="sec-2-1">
        <title>EMVM</title>
        <p>HSFL
AETC
CTES
DVMA
EDRP
BFDP
PAHD
Application
domain
●
s
r
e
t
n
e
c
a
t
a
D
●
●
●
●
●
●
●
d
u
o
l
C
d
u
o
l
C
d
i
r
b
y
H
●
●
●
●
●
d
e
z
i
l
a
r
t
n
e
C
●
●
d
e
z
i
l
a
r
t
n
e
c
e</p>
        <p>D</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Problem definition</title>
      <p>We assume that servers of the data center are identical, and described by tuples { , , , ,
}, where is a measure of instruction execution speed (MIPS), is the amount of memory
(MB), is the available bandwidth (Mbps), and is energy efficiency (MIPS per watt). We also
assume that data centers have enough resources to execute any job.</p>
      <p>The main objective of the proposed strategies is to minimize the total power consumption of
running workloads providing QoS guarantees.</p>
      <sec id="sec-3-1">
        <title>3.1 Job model</title>
        <p>
          We consider independent jobs . The job is described by a tuple
, where is the released time, is a processing time. The release time
of a job is not available before the job is submitted. is the SLA from a set
offered by the provider [
          <xref ref-type="bibr" rid="ref11 ref20 ref21">19, 10, 20</xref>
          ]. Each SLA represents a SL
guarantee, and is denoted by the slack factor . is the deadline of the job and is calculated at
the release of the job as . Finally characterizes a job as CPU intensive, disk I/O
intensive, memory intensive, network I/O intensive, etc.
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2 Energy model</title>
        <p>We present a nonlinear model of the power consumption by considering types of applications. Fig. 5
shows examples of the normalized power consumption of jobs of type A and type B vs CPU utilization
(%). Characteristics of CPU intensive, disk I/O intensive, memory intensive, network I/O intensive,
etc. applications influence on power consumption differently due to corresponding hardware
characteristics.</p>
        <p>Moreover, an allocation of two different applications to the same server could cause reduced power
consumption, less than the sum of their individual power consumptions. It also has an impact on
performance enhancement avoiding creation of a bottleneck and resource contention (either in CPU,
disk or network) that may result in additional degradation of the system performance and increased
energy consumption.</p>
        <p>We propose a hybrid model that takes into account power consumption of individual jobs and
their combinations. Due to diversity of applications and their combinations, we propose to consider
aggregated utilization of each type of applications (total utilization that contributes each job type or
concentration).</p>
        <p>Type A</p>
        <p>Type B
1
n
o
itp0,8
m
sun0,6
o
rce0,4
w
po0,2
d
e
liza 0
m
r
o
N
,
,</p>
        <p>Fig 5. Normalized power consumption of jobs A and B vs CPU utilization (%).</p>
        <p>The power consumption of the processor at time
consumption when the processor is turned on, but not used
the processor is in use :
consists of two parts: an idle power
, and power consumption when
where
time .</p>
        <p>
          , if the processor is on at time , and otherwise.
is a coefficient proposed in [
          <xref ref-type="bibr" rid="ref16">15</xref>
          ] to fit non-linear power profiles.
is the utilization at
where is the maximum power consumption when the processor is fully utilized.
        </p>
        <p>is the coefficient that represents the increment of power consumption when a
processor runs different types of applications. The concentration of type A vs type B at the time is
defined as .
0 ,500 ,01 ,150 ,02 ,250 ,03 ,350 ,04 ,45 ,05 ,550 ,06 ,650 ,07 ,750 ,08 ,850 ,09 ,950 1
0</p>
        <p>Fig 6. Proportion of the power consumption vs concentration of jobs A.</p>
        <p>
          The total power consumed by the system is the integral of power consumed during operation:
, with
(4)
We define . Following [
          <xref ref-type="bibr" rid="ref12">11</xref>
          ], with the power consumption of a processor
Fujitsu PRIMERGY TX300 S7, we set . We set , for (all jobs are type A),
and for (all jobs are type B).
        </p>
        <p>Fig. 7 shows the normalized power consumption when the processor runs two types of applications.</p>
        <p>Fig 7. Normalized power consumption of job A and B vs CPU utilization (%) and concentration of jobs A (%).</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Scheduling algorithms</title>
      <sec id="sec-4-1">
        <title>4.1 Scheduling approach</title>
        <p>
          In this section, we describe our scheduling approach and proposed energy-aware scheduling methods.
We address a two-level scheduling approach [
          <xref ref-type="bibr" rid="ref13 ref14 ref15 ref16">12, 13, 14, 15</xref>
          ]. At the upper level, the system verifies
whether a job can be accepted or not using a Greedy acceptance policy. If the job is accepted then the
system selects a machine from the set of admissible machines to execute the job on the lower level.
The greedy higher-level acceptance policy is based on the preemptive Earliest Due Date (EDD)
algorithm, which gives priority to jobs according to their deadlines. When a job arrives to the system,
in order to determine whether to accept or reject it, the system searches for the set of machines capable
of executing the job before its deadline assuring that no jobs in the machine will miss their deadlines.
If the set of available machines is not empty job is accepted otherwise it is rejected.
This completes the first stage of scheduling.
        </p>
        <p>Note that the preemptive EDD algorithm is well suited for our purpose as it is easy to apply and it
yields an optimal solution for the 1 | prmp, , online | Lmax problem. By EDD, we verify that all
already accepted jobs with a deadline greater than the deadline of the incoming job will be completed
before their deadline.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2 Allocation strategies</title>
        <p>The machine for job allocation can be determined by taking into account different criteria. In this
work, we study ten allocation strategies Rand, FFit, RR, ML, MTe, Me, Mu, Mau, Mujt, and Mc. (see
Table 2). They are characterized by the type and the amount of information used for allocation
decision.</p>
        <p>
          We categorize the proposed methods in three groups: (1) knowledge-free, with no information
about applications and resources [
          <xref ref-type="bibr" rid="ref17 ref18 ref19">16, 17, 18</xref>
          ]; (2) energy-aware, with power consumption information;
and (3) utilization-aware with utilization of machines information.
        </p>
        <sec id="sec-4-2-1">
          <title>Type</title>
          <p>Strategy</p>
          <p>Rand
e
g
ledow reeF FRFRit(R(FoirusntdFRit)obin)
n
K
rgy re
e a
nE aw</p>
          <p>ML (Min load)
MTe
(Min-Total_energy)
Me
(Min-energy)
Mu
(Min-utilization)
n
tiao raew (MMaaux-utilization)
z
i
itl a
U</p>
          <p>Mujt
(Min-util_job_type)
Mc
(Min-concentration)</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusions</title>
      <p>allocates job to a suitable machine randomly selected using a uniform
distribution in the range .
allocates job</p>
      <p>to the first machine available and capable to execute it.
allocates job to the machine available and capable to execute by Round
Robin strategy
allocates job to the machine with the least load at time :
allocates job to the machine with minimum total power consumption at
time :
allocates job to the machine with minimum power consumption at time
:
allocates job to the machine with minimum total utilization at time
allocates job to the machine with maximum total utilization at time
allocates job to the machine with minimum utilization of jobs of the same
type at time
allocates job to the machine with minimum concentration of jobs of the
same type at time</p>
      <p>In this paper, we consider the problem of energy optimization in Cloud computing from the
perspective of the Cloud service provider. We formulate and discuss the energy model and
energyaware resource allocation problem that provide energy-efficiency and QoS guarantees simultaneously
by heterogeneous job consolidation taking into account types of applications. A generic Cloud
computing environment has to process multiple applications for multiple users, which create mixed
workloads of different types with different energy consumption.
We consider energy characteristics of applications such as CPU intensive, disk I/O intensive,
memory intensive, network I/O intensive, etc. and their influence on power consumption due to the
nature of used hardware. We discuss how an awareness of the job type could help to improve energy
consumption. Intelligent job allocation has an impact on performance enhancement avoiding creation
of bottlenecks and resource contentions either in CPU, disk or network, and on decreasing total energy
consumption.</p>
      <p>We propose a hybrid model that take into account the power consumption of individual jobs and
their combination. We propose using aggregated utilization of applications, and their concentration for
job allocation.</p>
      <p>However, further study for energy consumption of multiple job types and their concentration is
required to assess the actual efficiency and effectiveness of the proposed method. This will be the
subject of future work for better understanding of the resource contentions and its impact on the
energy consumption, QoS and multi-objective optimization in clouds.
Conference on High Performance Computing &amp; Simulation (HPCS 2014), pp 911–918, Bologna,
Italy (2014)</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <volume>1 2 3 4 5 6 7</volume>
          8 9
          <string-name>
            <given-names>D.</given-names>
            <surname>Kliazovich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. E.</given-names>
            <surname>Pecero</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Tchernykh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bouvry</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. U.</given-names>
            <surname>Khan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. Y.</given-names>
            <surname>Zomaya</surname>
          </string-name>
          , “CA-DAG:
          <article-title>Modeling Communication-Aware Applications for Scheduling in Cloud Computing,”</article-title>
          <source>Journal of Grid Computing</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <given-names>A.</given-names>
            <surname>Beloglazov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Abawajy</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Buyya</surname>
          </string-name>
          , “
          <article-title>Energy-aware resource allocation heuristics for efficient management of data centers for Cloud computing,” Future Gener</article-title>
          .
          <source>Comput. Syst.</source>
          , vol.
          <volume>28</volume>
          , no.
          <issue>5</issue>
          , pp.
          <fpage>755</fpage>
          -
          <lpage>768</lpage>
          , May
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <given-names>J.</given-names>
            <surname>Luo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Chen</surname>
          </string-name>
          , “
          <article-title>Hybrid shuffled frog leaping algorithm for energy-efficient dynamic consolidation of virtual machines in cloud data centers,” Expert Syst</article-title>
          .
          <source>Appl.</source>
          , vol.
          <volume>41</volume>
          , no.
          <issue>13</issue>
          , pp.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          5804-
          <fpage>5816</fpage>
          , Oct.
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>C.-H. Hsu</surname>
            ,
            <given-names>K. D.</given-names>
          </string-name>
          <string-name>
            <surname>Slagter</surname>
          </string-name>
          , S.-C. Chen, and Y.-C. Chung, “
          <article-title>Optimizing Energy Consumption with Task Consolidation in Clouds,” Inf</article-title>
          . Sci., vol.
          <volume>258</volume>
          , pp.
          <fpage>452</fpage>
          -
          <lpage>462</lpage>
          , Feb.
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <given-names>S.</given-names>
            <surname>Hosseinimotlagh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Khunjush</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Hosseinimotlagh</surname>
          </string-name>
          , “
          <article-title>A Cooperative Two-Tier EnergyAware Scheduling for Real-Time Tasks in Computing Clouds,”</article-title>
          <source>in Proceedings of the 2014 22Nd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing</source>
          , Washington, DC, USA,
          <year>2014</year>
          , pp.
          <fpage>178</fpage>
          -
          <lpage>182</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Fan</surname>
          </string-name>
          , and
          <string-name>
            <given-names>X.</given-names>
            <surname>Jia</surname>
          </string-name>
          , “
          <article-title>A Decentralized Virtual Machine Migration Approach of Data Centers for Cloud Computing</article-title>
          ,” Math. Probl. Eng., vol.
          <year>2013</year>
          , p.
          <fpage>e878542</fpage>
          ,
          <string-name>
            <surname>Aug</surname>
          </string-name>
          .
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <given-names>Y.</given-names>
            <surname>Gao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. K.</given-names>
            <surname>Gupta</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Pedram</surname>
          </string-name>
          , “
          <article-title>An Energy and Deadline Aware Resource Provisioning, Scheduling and Optimization Framework for Cloud Systems</article-title>
          ,” in
          <source>Proceedings of the Ninth IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis</source>
          , Piscataway, NJ, USA,
          <year>2013</year>
          , pp.
          <volume>31</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>31</lpage>
          :
          <fpage>10</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <given-names>L.</given-names>
            <surname>Luo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. T.</given-names>
            <surname>Tsai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Di</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , “
          <article-title>Simulation of power consumption of cloud data centers</article-title>
          ,
          <source>” Simul. Model. Pract. Theory</source>
          , vol.
          <volume>39</volume>
          , pp.
          <fpage>152</fpage>
          -
          <lpage>171</lpage>
          , Dec.
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Ma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Qi</surname>
          </string-name>
          , and
          <string-name>
            <given-names>H.</given-names>
            <surname>Guan</surname>
          </string-name>
          , “
          <article-title>Power-aware I/O-Intensive and CPUIntensive applications hybrid deployment within virtualization environments</article-title>
          ,” in
          <source>2010 IEEE International Conference on Progress in Informatics and Computing (PIC)</source>
          ,
          <year>2010</year>
          , vol.
          <volume>1</volume>
          , pp.
          <fpage>509</fpage>
          -
          <lpage>513</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          10 Lezama,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Tchernykh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Yahyapour</surname>
          </string-name>
          ,
          <string-name>
            <surname>R.</surname>
          </string-name>
          <article-title>: Performance Evaluation of Infrastructure as a Service Clouds with SLA Constraints</article-title>
          .
          <source>Computación y Sistemas</source>
          <volume>17</volume>
          (
          <issue>3</issue>
          ):
          <fpage>401</fpage>
          -
          <lpage>411</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <surname>11 S. B. Matthias Splieth</surname>
          </string-name>
          , “
          <article-title>Analyzing the Effect of Load Distribution Algorithms on Energy Consumption of Servers in Cloud Data Centers</article-title>
          ,”
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          12.
          <string-name>
            <surname>Tchernykh</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lozano</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schwiegelshohn</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bouvry</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pecero</surname>
            ,
            <given-names>J. E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nesmachnow</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <string-name>
            <surname>Energy-Aware Online</surname>
          </string-name>
          Scheduling:
          <article-title>Ensuring Quality of Service for IaaS Clouds</article-title>
          . International
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          13.
          <string-name>
            <surname>Tchernykh</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schwiegelsohn</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yahyapour</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuzjurin</surname>
          </string-name>
          , N.:
          <article-title>Online Hierarchical Job Scheduling on Grids with Admissible Allocation</article-title>
          ,
          <source>Journal of Scheduling</source>
          <volume>13</volume>
          (
          <issue>5</issue>
          ):
          <fpage>545</fpage>
          -
          <lpage>552</lpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          14.
          <string-name>
            <surname>Tchernykh</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ramírez</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Avetisyan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuzjurin</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grushin</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,.
          <string-name>
            <surname>Zhuk</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Two Level JobScheduling Strategies for a Computational Grid</article-title>
          . In R. Wyrzykowski et al.
          <source>(eds.) Parallel Processing and Applied Mathematics, 6th International Conference on Parallel Processing and Applied Mathematics. Poznan, Poland</source>
          ,
          <year>2005</year>
          , LNCS 3911, pp.
          <fpage>774</fpage>
          -
          <lpage>781</lpage>
          , Springer-Verlag (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          15.
          <string-name>
            <surname>Dorronsoro</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nesmachnow</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Taheri</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zomaya</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Talbi</surname>
            ,
            <given-names>E-G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bouvry</surname>
            ,
            <given-names>P.:</given-names>
          </string-name>
          <article-title>A hierarchical approach for energy-efficient scheduling of large workloads in multicore distributed systems</article-title>
          .
          <source>Sustainable Computing: Informatics and Systems</source>
          <volume>4</volume>
          :
          <fpage>252</fpage>
          -
          <lpage>261</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          16 Tchernykh,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Pecero</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Barrondo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Schaeffer</surname>
          </string-name>
          ,
          <string-name>
            <surname>E.</surname>
          </string-name>
          :
          <article-title>Adaptive Energy Efficient Scheduling in Peer-to-Peer Desktop Grids</article-title>
          ,
          <source>Future Generation Computer Systems</source>
          ,
          <volume>36</volume>
          :
          <fpage>209</fpage>
          -
          <lpage>220</lpage>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          17 Ramírez,
          <string-name>
            <given-names>J.M.</given-names>
            ,
            <surname>Tchernykh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Yahyapour</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Schwiegelshohn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>U.</given-names>
            ,
            <surname>Quezada</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>González</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Hirales</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          :
          <article-title>Job Allocation Strategies with User Run Time Estimates for Online Scheduling in Hierarchical Grids</article-title>
          .
          <source>Journal of Grid Computing</source>
          <volume>9</volume>
          :
          <fpage>95</fpage>
          -
          <lpage>116</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          18 Iturriaga,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Nesmachnow</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Dorronsoro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Bouvry</surname>
          </string-name>
          ,
          <string-name>
            <surname>P.</surname>
          </string-name>
          :
          <article-title>Energy efficient scheduling in heterogeneous systems with a parallel multiobjective local search</article-title>
          .
          <source>Computing and Informatics</source>
          <volume>32</volume>
          (
          <issue>2</issue>
          ):
          <fpage>273</fpage>
          -
          <lpage>294</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          19 Schwiegelshohn,
          <string-name>
            <given-names>U.</given-names>
            ,
            <surname>Tchernykh</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          :
          <article-title>Online Scheduling for Cloud Computing and Different Service Levels</article-title>
          ,
          <source>26th Int. Parallel and Distributed Processing</source>
          Symposium Los Alamitos, CA, pp.
          <fpage>1067</fpage>
          -
          <lpage>1074</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          20 Tchernykh,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Lozano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            ,
            <surname>Schwiegelshohn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>U.</given-names>
            ,
            <surname>Bouvry</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Pecero</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Nesmachnow</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Drozdov</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          <article-title>Online Bi-Objective Scheduling for IaaS Clouds with Ensuring Quality of Service</article-title>
          .
          <source>Journal of Grid Computing</source>
          , Springer-Verlag,
          <source>DOI 10.1007/s10723-015-9340-0</source>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>