Low-Energy-Orientated Resource Scheduling in Cloud Computing by Particle Swarm Optimization
In order to reduce the energy cost in cloud computing, this paper represents a novel energy-orientated resource scheduling method based on particle swarm optimization. The energy cost model in cloud computing environment is studied first. The optimization of energy cost is then considered as a multi...
Format: | Article |
---|---|
Language: | zho |
Published: |
The Northwestern Polytechnical University
2018-04-01
|
Series: | Xibei Gongye Daxue Xuebao |
Subjects: | |
Online Access: | https://www.jnwpu.org/articles/jnwpu/pdf/2018/02/jnwpu2018362p339.pdf |
id |
doaj-5828a9fcd40a4e6eaad5b3fdbe018195 |
---|---|
record_format |
Article |
spelling |
doaj-5828a9fcd40a4e6eaad5b3fdbe0181952021-05-02T21:53:52ZzhoThe Northwestern Polytechnical UniversityXibei Gongye Daxue Xuebao1000-27582609-71252018-04-0136233934410.1051/jnwpu/20183620339jnwpu2018362p339Low-Energy-Orientated Resource Scheduling in Cloud Computing by Particle Swarm Optimization01School of Automation, Northwestern Polytechnical UniversitySchool of Automation, Northwestern Polytechnical UniversityIn order to reduce the energy cost in cloud computing, this paper represents a novel energy-orientated resource scheduling method based on particle swarm optimization. The energy cost model in cloud computing environment is studied first. The optimization of energy cost is then considered as a multiobjective optimization problem, which generates the Pareto optimization set. To solve this multiobjective optimization problem, the particle swarm optimization is involved. The states of one particle consist of both the allocation plan for servers and the frequency plans on servers. Each particle in this algorithm obtains its Pareto local optimization. After the assembly of local optimizations, the algorithm generates the Pareto global optimization for one server plan. The final solution to our problem is the optimal one among all server plans. Experimental results show the good performance of the proposed method. Comparing with the widely-used Round robin scheduling method, the proposed method requires only 45.5% dynamic energy cost.https://www.jnwpu.org/articles/jnwpu/pdf/2018/02/jnwpu2018362p339.pdfcloud computingcost functionpareto optimalityresource schedulingparticle swarmscheduling alogorithms |
collection |
DOAJ |
language |
zho |
format |
Article |
sources |
DOAJ |
title |
Low-Energy-Orientated Resource Scheduling in Cloud Computing by Particle Swarm Optimization |
spellingShingle |
Low-Energy-Orientated Resource Scheduling in Cloud Computing by Particle Swarm Optimization Xibei Gongye Daxue Xuebao cloud computing cost function pareto optimality resource scheduling particle swarm scheduling alogorithms |
title_short |
Low-Energy-Orientated Resource Scheduling in Cloud Computing by Particle Swarm Optimization |
title_full |
Low-Energy-Orientated Resource Scheduling in Cloud Computing by Particle Swarm Optimization |
title_fullStr |
Low-Energy-Orientated Resource Scheduling in Cloud Computing by Particle Swarm Optimization |
title_full_unstemmed |
Low-Energy-Orientated Resource Scheduling in Cloud Computing by Particle Swarm Optimization |
title_sort |
low-energy-orientated resource scheduling in cloud computing by particle swarm optimization |
publisher |
The Northwestern Polytechnical University |
series |
Xibei Gongye Daxue Xuebao |
issn |
1000-2758 2609-7125 |
publishDate |
2018-04-01 |
description |
In order to reduce the energy cost in cloud computing, this paper represents a novel energy-orientated resource scheduling method based on particle swarm optimization. The energy cost model in cloud computing environment is studied first. The optimization of energy cost is then considered as a multiobjective optimization problem, which generates the Pareto optimization set. To solve this multiobjective optimization problem, the particle swarm optimization is involved. The states of one particle consist of both the allocation plan for servers and the frequency plans on servers. Each particle in this algorithm obtains its Pareto local optimization. After the assembly of local optimizations, the algorithm generates the Pareto global optimization for one server plan. The final solution to our problem is the optimal one among all server plans. Experimental results show the good performance of the proposed method. Comparing with the widely-used Round robin scheduling method, the proposed method requires only 45.5% dynamic energy cost. |
topic |
cloud computing cost function pareto optimality resource scheduling particle swarm scheduling alogorithms |
url |
https://www.jnwpu.org/articles/jnwpu/pdf/2018/02/jnwpu2018362p339.pdf |
_version_ |
1721487081052569600 |