Journal of Computer Science | |
A NEW-THRESHOLD BASED JOB SCHEDULING FOR GRID SYSTEM | Science Publications | |
L. Ramaparvathy1  | |
关键词: New-Threshold Based Scheduling (NTBS); Makespan; Grid Jobs and Turnaround Time; | |
DOI : 10.3844/jcssp.2014.1069.1076 | |
学科分类:计算机科学(综合) | |
来源: Science Publications | |
【 摘 要 】
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 users 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.
【 授权许可】
Unknown
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
RO201911300483061ZK.pdf | 287KB | download |