Research Article Open Access

A NEW-THRESHOLD BASED JOB SCHEDULING FOR GRID SYSTEM

L. Ramaparvathy1
  • 1 , India

Abstract

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.

Journal of Computer Science
Volume 10 No. 6, 2014, 1069-1076

DOI: https://doi.org/10.3844/jcssp.2014.1069.1076

Submitted On: 2 January 2014 Published On: 3 February 2014

How to Cite: Ramaparvathy, L. (2014). A NEW-THRESHOLD BASED JOB SCHEDULING FOR GRID SYSTEM. Journal of Computer Science, 10(6), 1069-1076. https://doi.org/10.3844/jcssp.2014.1069.1076

  • 2,777 Views
  • 2,222 Downloads
  • 1 Citations

Download

Keywords

  • New-Threshold Based Scheduling (NTBS)
  • Makespan
  • Grid Jobs and Turnaround Time