Workflow scheduling using Jaya algorithm in cloud. (26th April 2019)

• Record Type: Journal Article
• Authors: Gupta, Swati; Agarwal, Isha; Singh, Ravi Shankar
• Is Part Of: Concurrency and computation. Volume 31:Number 17(2019)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2019-04-26
• Subjects: cloud computing -- execution cost -- independent task -- Jaya -- makespan -- workflow scheduling; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.5251
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: Cloud computing is an on‐demand service that can be accessed by a user according to his requirements through the Internet. Multiple users can request any amount of services, so scheduling of those services is a crucial task in cloud computing. Scheduling is a way of assigning the work to a computer resource. We have multiple tasks at a time that are waiting to be allotted to multiple computer resources. Various optimization algorithms have been used to do task scheduling so that total execution cost is minimized. In this paper, we have implemented Jaya optimization algorithm for workflow scheduling and have compared it with four nature‐inspired algorithms, namely, particle swarm optimization (PSO), genetic algorithm (GA), ant colony optimization (ACO), honey bee, and cat swarm optimization (CSO), keeping the fitness function same for all of them using CloudSim. Previously, work has been done on PSO, GA, ACO, honey bee, and CSO using different criteria. The results are compared on the basis of execution cost and makespan of the algorithm on both an independent set of tasks and a set of tasks that follow a workflow schedule. Benchmark functions such as Montage, CyberShake, Inspiral, and Sipht are used for workflow scheduling. It has been observed that Jaya outperforms the other algorithms as it produces similar results in the least amount of time as it converges very quickly.