Design of candidate schedules for applying iterative ordinal optimisation for scheduling technique on cloud computing platform Online publication date: Tue, 11-Feb-2020
by Monika Yadav; Atul Mishra; Balamurugan Balusamy
International Journal of Internet Manufacturing and Services (IJIMS), Vol. 7, No. 1/2, 2020
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Internet Manufacturing and Services (IJIMS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook