A priority based task scheduling in cloud computing using a hybrid MCDM model

8Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Task scheduling is an interesting topic in cloud computing nowadays. The mapping of the cloud resources to process the customer requests is very challenging and a well-known NP-Complete problem. In this paper, we address this problem with the consideration of the priority as one of the critical issues in the task scheduling process. The priority is computed according to the most important parameters that can meet user’s requirements and improve the resource utilization. We propose a new Dynamic Priority-Queue (DPQ) approach based on a hybrid multi-criteria decision making (MCDM) namely ELECTRE III and Differential Evolution (DE). Furthermore, to schedule the tasks, we introduce a hybrid meta-heuristic algorithm based on Particle Swarm Optimization (PSO) and Simulated Annealing (SA). The proposed DEELDPQ-SAPSO approach has been validated through the CloudSim simulator. The experimental results show that the proposed approach can achieve good performance, user priority, load balancing and improve the resource utilization.

Cite

CITATION STYLE

APA

Ben Alla, H., Ben Alla, S., & Ezzati, A. (2017). A priority based task scheduling in cloud computing using a hybrid MCDM model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10542 LNCS, pp. 235–246). Springer Verlag. https://doi.org/10.1007/978-3-319-68179-5_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free