Abstract
In heterogeneous distributed systems, utility grids have emerged as a new model of service. In this se rvice, workflow scheduling is one of the challenging probl ems for satisfying user’s quality requirements. One of the main issues in work flow scheduling is to minim ize the workflow execution cost in terms of time an d makespan. In this study, we propose a new workflow scheduling algorithm based on a novel concept calle d New-Threshold Based Scheduling (NTBS) that attempts to minimize the cost of workflow execution time and provides service fairness. It works under two p hases. The scheduler computes threshold in first ph ase and in second phase it schedules the grid jobs to r educe the execution time without affecting fairness . From the simulation results it is observed that NTBS giv es better performance in terms of reduced makespan and consistent turnaround time as compared to FCFS, EDF and other scheduling algorithms.
Highlights
Traditional grid scheduling problems are addressed in many papers; there are only a few works on this problem
We propose a new workflow scheduling algorithm based on a novel concept called New-Threshold Based Scheduling (NTBS) that attempts to minimize the cost of workflow execution time and provides service fairness
The performance of Min-Min, Fastest Processor to Largest Task First (FPLTF) and Largest Task First (LTF) is good when the available resource is closer to number of jobs and it decays under resource constraint situation
Summary
Traditional grid scheduling problems are addressed in many papers; there are only a few works on this problem. As workflow job scheduling is a known problem, many methods have been proposed for homogeneous (Kwok and Ahmad, 1999) and heterogeneous distributed grid systems by several authors (Topcuoglu et al, 2002; Bajaj and Agrawal, 2004; Daoud and Kharma, 2008). These scheduling methods try to minimize the execution time of the workflows and suitable for community grids.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
