|
|
An Efficient Dynamic Priority-Queue Algorithm Based on AHP and PSO for Task Scheduling in Cloud Computing Host Publication: International Conference on Hybrid Intelligent Systems (HIS 2016) Authors: H. Ben Alla, S. Ben Alla, A. Touhafi and A. Ezzati Publisher: Springer Publication Date: Nov. 2016 Number of Pages: 10 ISBN: 978-3-319-52940-0
Abstract: Nowadays Cloud Computing is an emerging technology in the area of parallel and distributed computing. Task scheduling is one of the major issues in cloud computing, which plays an important role to improve the overall performance and services of the cloud. Task scheduling in cloud computing means assign best suitable resources for the task to be executed with the consideration of different parameters like execution time, user priority, cost, scalability, throughput, makespan, resource utilization and so on. In this paper, we address the challenge of task scheduling, and we consider one of most critical issues in scheduling process such as the task priorities. The goal of this paper is to propose an efficient Dynamic Priority-Queue (DPQ) algorithm based on Analytic Hierarchy Process (AHP) with Particle Swarm Optimization (PSO) algorithm. The proposed algorithm DPQ-PSO gives full consideration to the dynamic characteristics of the cloud computing environment. Further, the proposed algorithm has been validated through the CloudSim simulator. The experimental results validate that the proposed approach can effectively achieve good performance, user priority, load balancing, and improve the resource utilization.
|
|
