You can view the full text of this article for free using the link below.

Title: Design of candidate schedules for applying iterative ordinal optimisation for scheduling technique on cloud computing platform

Authors: Monika Yadav; Atul Mishra; Balamurugan Balusamy

Addresses: Department of Computer Science Engineering, J.C. Bose University of Science and Technology YMCA, Faridabad, India ' Department of Computer Engineering, YMCA University of Science and Technology, Faridabad, India ' Department of Computer Science and Engineering, Galgotias University, Greater Noida, India

Abstract: In cloud computing, distributed resources are used on demand basis without having the physical infrastructure at the client end. Cloud has a large number of users and to deal with large number of task, so scheduling in cloud plays a vital role for task execution. Scheduling of various multitask jobs on clouds is considered as an NP-hard problem (Horng and Lin, 2017). In order to reduce the large scheduling search space, an iterative ordinal optimisation (IOO) method has already proposed. In this paper, a set of 30 candidate schedules denoted by set U are created. The set U is used in the exhaustive search of the best schedule. After analysing the set U, an ordered schedule vs. makespan graph is plotted. So in this work, set U is defined and created a base for applying IOO method to get optimal schedules. In this work, CloudSim version 3.0 has been used to test and analyse policies.

Keywords: cloud computing; iterative ordinal optimisation; makespan; CloudSim; schedules.

DOI: 10.1504/IJIMS.2020.10026746

International Journal of Internet Manufacturing and Services, 2020 Vol.7 No.1/2, pp.5 - 19

Received: 15 Mar 2018
Accepted: 26 Jun 2018

Published online: 11 Feb 2020 *

Full-text access for editors Access for subscribers Free access Comment on this article