Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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

Design of candidate schedules for applying iterative ordinal optimisation for scheduling... 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Internet Manufacturing and Services Inderscience Publishers

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

Loading next page...
 
/lp/inderscience-publishers/design-of-candidate-schedules-for-applying-iterative-ordinal-wtMHltRTSQ
Publisher
Inderscience Publishers
Copyright
Copyright © Inderscience Enterprises Ltd
ISSN
1751-6048
eISSN
1751-6056
DOI
10.1504/IJIMS.2020.105027
Publisher site
See Article on Publisher Site

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.

Journal

International Journal of Internet Manufacturing and ServicesInderscience Publishers

Published: Jan 1, 2020

There are no references for this article.