Task scheduling of cloud computing using integrated particle swarm algorithm and ant colony algorithm

The optimization of task scheduling in cloud computing is built with the purpose of improving its working efficiency. Aiming at resolving the deficiencies during the method deployment, supporting algorithms are therefore introduced. This paper proposes a particle swarm optimization algorithm with th...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Cluster computing Ročník 22; číslo Suppl 2; s. 2761 - 2769
Hlavní autoři: Chen, Xuan, Long, Dan
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.03.2019
Springer Nature B.V
Témata:
Algorithms
Ant colony optimization
Cloud computing
Computer Communication Networks
Computer Science
Decomposition
Employment
Genetic algorithms
Normal distribution
Operating Systems
Optimization
Particle swarm optimization
Processor Architectures
Scheduling
Task analysis
Task scheduling
Task scheduling
Cloud computing
Ant colony optimization
Particle swarm algorithm
ISSN:1386-7857, 1573-7543
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The optimization of task scheduling in cloud computing is built with the purpose of improving its working efficiency. Aiming at resolving the deficiencies during the method deployment, supporting algorithms are therefore introduced. This paper proposes a particle swarm optimization algorithm with the combination of based on ant colony optimization, which proposes the parameter determination into particle swarm algorithm. The integrated algorithm is capable of keeping particles in the fitness level at a certain concentration and guarantee the diversity of population. Further, the global best solution with high accurate converge can be exactly gained with the adjustment of learning factor. After the implementation of proposed method in task scheduling, the scheme for optimizing task scheduling shows better working performance in fitness, cost as well as running period, which presents a more reliable and efficient idea of optimal task scheduling.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1386-7857
1573-7543
DOI:10.1007/s10586-017-1479-y