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

被引：0

作者：

Yadav M. ^{[1
]}

Mishra A. ^{[2
]}

Balusamy B. ^{[3
]}

机构：

[1] Department of Computer Science Engineering, J.C. Bose University of Science and Technology YMCA, Faridabad

[2] Department of Computer Engineering, YMCA University of Science and Technology, Faridabad

[3] Department of Computer Science and Engineering, Galgotias University, Greater Noida

来源：

International Journal of Internet Manufacturing and Services | 2020年 / 7卷 / 1-2期

关键词：

Cloud computing; CloudSim; Iterative ordinal optimisation; Makespan; Schedules;

D O I：

10.1504/IJIMS.2020.105027

中图分类号：

学科分类号：

摘要：

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. © 2020 Inderscience Enterprises Ltd.

引用

页码：5 / 19

页数：14

共 18 条

[1]

Beyer H.G., Sendhoff B., Toward a steady-state analysis of an evolution strategy on a robust optimization problem with noise-induced multimodality, IEEE Trans. Evol. Comput., 21, 4, pp. 629-643, (2017)

[2]

Buyya R., Ranjan R., Calheiros R.N., Modeling and simulation of scalable cloud computing environments and the CloudSim toolkit: Challenges and opportunities, Proceedings of the Conference on High Performance Computing and Simulation (HPCS 2009), pp. 1-11, (2009)

[3]

Calheiros R.N., Ranjan R., Beloglazov A., De Rose C.A.F., Buyya R., CloudSim: A toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms, Software Practice and Experience, (2010)

[4]

Ho Y.C., Cassandrasv C.C., Chen C.H., Dai L., Ordinal optimization and simulation, J. Oper. Res. Soc., 51, 4, pp. 490-500, (2000)

[5]

Ho Y.-C., Zhao Q.-C., Jiam Q.-S., Ordinal Optimization: Soft Optimization for Hard Problems, 16, (2007)

[6]

Hoffa C., Et al., On the use of cloud computing for scientific workflows, IEEE Int'l Conf. On EScience, (2008)

[7]

Horng S.C., Lin S.Y., Ordinal optimization based metaheuristic algorithm for optimal inventory policy of assemble-to-order systems, Appl. Math. Model., 42, 1, pp. 43-57, (2017)

[8]

Hwang K., Fox G., Dongarra J., Distributed and Cloud Computing Systems: From Parallel Processing to the Internet of Things, (2011)

[9]

Jia Q.S., Ho Y.C., Zhao Q.C., Comparison of selection rules for ordinal optimization, Mathematical and Computer Modelling, 43, 9-10, pp. 1150-1171, (2006)

[10]

Katyal M., Mishra A., Application of selective algorithm for effective resource provisioning in cloud computing environment, International Journal on Cloud Computing: Services and Architecture (IJCCSA), February, 4, 1, pp. 1-10, (2014)

← 1 2 →