Fitness rate-based rider optimization enabled for optimal task scheduling in cloud

Abdalla Alameen, Ashu Gupta

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

Not long ago, there has been a dramatic augment in the attractiveness of cloud computing systems that depends computing resources on-demand, bill on a pay-as-you-go basis, and multiplex many users on the same physical infrastructure. It is considered as an essential pool of resources, which are offered to users through Internet. Without troubling the fundamental infrastructure, pay-per-use computing resources are provided to the users by the cloud computing technology. Scheduling is a significant dilemma in cloud computing as a cloud provider has to serve multiple users in cloud environment. This proposal plans to implement an optimal task scheduling model in cloud sector as a challenge over the existing technologies. The proposed model solves the task scheduling problem using an improved meta-heuristic algorithm called Fitness Rate-based Rider Optimization Algorithm (FR-ROA), which is the advanced form of conventional Rider Optimization Algorithm (ROA). The objective constraints considered for optimal task scheduling are the maximum makespan or completion time, and the sum of the completion times of entire tasks. Since the proposed FR-ROA has attained the advantageous part of reaching the convergence in a small duration, the proposed model will outperform the other conventional algorithms for accomplishing the optimal task scheduling in cloud environment.

Original languageEnglish
Pages (from-to)310-326
Number of pages17
JournalInformation Security Journal
Volume29
Issue number6
DOIs
StatePublished - 1 Nov 2020

Keywords

  • Cloud computing
  • convergence analysis
  • Improved Rider Optimization Algorithm (ROA)
  • makespan
  • task scheduling

Fingerprint

Dive into the research topics of 'Fitness rate-based rider optimization enabled for optimal task scheduling in cloud'. Together they form a unique fingerprint.

Cite this