z-logo
open-access-imgOpen Access
AVAILABILITY EVALUATION OF DIFFERENT PLANNING AND SCHEDULING ALGORITHMS IN HYBRID CLOUD SYSTEM
Author(s) -
Ahmed A. Hamed,
Rabah A. Ahmed
Publication year - 2020
Publication title -
iraqi journal of information and communication technology/iraqi journal of information and communication technology
Language(s) - English
Resource type - Journals
eISSN - 2789-7362
pISSN - 2222-758X
DOI - 10.31987/ijict.3.4.126
Subject(s) - cloudsim , computer science , cloud computing , distributed computing , scheduling (production processes) , downtime , two level scheduling , fair share scheduling , workflow , rate monotonic scheduling , algorithm , dynamic priority scheduling , job shop scheduling , directed acyclic graph , real time computing , operating system , mathematical optimization , schedule , database , mathematics
The importance of hybrid cloud computing has become a reality in recent years for large and medium enterprises and even at the individual level, which increases the need for many improvements in its availability level. One of the most important things that affects availability is the task scheduling process. Task scheduling is subject to many scheduling algorithms and these algorithms differ in terms of performance and purpose, the most important aspects being improved by using an appropriate scheduling algorithm is the total execution time(makespane) and also the success rate and downtime live migration. Because working on a cloud computing environment is costly and complex, we have simulated a hybrid cloud environment using reliable and accurate simulation and used Directed acyclic graph(DAG) as a workflow application. In this paper we will compare scheduling and planning algorithms for cloud computing environment by implementing a framework using (workflowsim) based on (cloudsim) simulator in order to choose the best algorithm to verify the possibility of improving availability.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here