itabaQiKkhS4nWmpI3YYSIFy4m9pN8itWb4FyTGn2Y9IFDGW9SykwieXJ5qo
Current position: Home >> Scientific Research >> Paper Publications

PACO: A Period ACO_based Scheduling Algorithm in Cloud Computing

Release Time:2019-03-11  Hits:

Indexed by: Conference Paper

Date of Publication: 2013-12-16

Included Journals: Scopus、CPCI-S、EI

Page Number: 482-486

Key Words: cloud computing; task scheduling; ant colony algorithm; scheduling period

Abstract: Tasks scheduling problem in cloud computing is NP-hard, and it is difficult to attain an optimal solution, so we can use intelligent optimization algorithms to approximate the optimal solution, such as ant colony optimization algorithm. In order to solve the task scheduling problem in cloud computing, a period ACO_based scheduling algorithm (PACO) has been proposed in this paper. PACO uses ant colony optimization algorithm in cloud computing, with the first proposed scheduling period strategy and the improvement of pheromone intensity update strategy. The experiments results show that, PACO has a good performance both in makespan and load balance of the whole cloud cluster.

Prev One:A Flexible Load-Balancing Traffic Grooming Algorithm in Service Overlay Network

Next One:An Efficient Multi-Path Self-Organizing Strategy in Internet of Things