RFM-PSO-RFM score based PSO task scheduling in cloud

ISSN: 22783075
1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

Abstract

Resource Management problem is considered as the major issue in recent decades This paper presents a novel particle swarm optimisation algorithm, with RFM score. Our proposed algorithm is used to solve the task scheduling problem. In our proposed algorithm there are two phases. RFM analysis of customers is done to improve the user experience as well as to increase the profit of cloud provider. The tasks are ranked according to RFM score and given priority according to the best rank. Ranked tasks forms the initial population of Particle swarm optimisation (PSO). In the Second phase the tasks are classified as CPU-intensive and I/O intensive. The two-phase algorithm helps to improve the performance of scheduling. Our proposed algorithm uses Cloudsim and compared with the existing metaheuristic algorithms like ACO and GA. Experimental results show that the RFM-PSO algorithm outperforms the other algorithms.

Cite

CITATION STYLE

APA

Valarmathi, R., & Sheela, T. (2019). RFM-PSO-RFM score based PSO task scheduling in cloud. International Journal of Innovative Technology and Exploring Engineering, 8(6), 25–29.

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