Journal of Computer Science


L. Ramaparvathy

DOI : 10.3844/jcssp.2014.1069.1076

Journal of Computer Science

Volume 10, Issue 6

Pages 1069-1076


In heterogeneous distributed systems, utility grids have emerged as a new model of service. In this service, workflow scheduling is one of the challenging problems for satisfying user’s quality requirements. One of the main issues in work flow scheduling is to minimize the workflow execution cost in terms of time and makespan. In this study, 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. It works under two phases. The scheduler computes threshold in first phase and in second phase it schedules the grid jobs to reduce the execution time without affecting fairness. From the simulation results it is observed that NTBS gives better performance in terms of reduced makespan and consistent turnaround time as compared to FCFS, EDF and other scheduling algorithms.


© 2014 L. Ramaparvathy. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.