Open Accessi- Rosa, Improved Uncertainty Aware Workflow Scheduling Algorithm
Author(s) -
Namrata Bulchandani,
Shikha Agrawal,
Prof. Uday Chourasia,
Priyanka Dixit,
Shivani Sharma
Publication year - 2019
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.k2071.0981119
Subject(s) - workflow , computer science , scheduling (production processes) , distributed computing , fair share scheduling , dynamic priority scheduling , cloud computing , two level scheduling , schedule , algorithm , database , mathematical optimization , operating system , mathematics
Many applications running in cloud computing environment are workflow applications which contain large number of precedence specific tasks and so require proper schedule in order to complete successfully. Efficient scheduling of workflow applications is a challenging task. In workflows, the uncertainties like ‘uncertain data transfer time’ among dependent tasks and the uncertain task execution time, if ignored may lead to deadline violation. The proposed workflow scheduling algorithms so far unconcerned these uncertainties. This paper presents an improved unceRtainty aware workflow scheduling algorithm abbreviated as i-ROSA, that considers the uncertainties of scheduling workflows such as the uncertain running time of tasks in distributed environment when focused upon gave the superior outcome in way of cost and resource utilization, for DAG when compared with the original algorithm. The compared task scheduling algorithms are implemented in Workflowsim.