Scheduling of workflow jobs based on twostep clustering and lowest job weight

Abstract

Scheduling is an important technique to improve the productivity of workflow applications in a grid system. Serving workflow applications added overhead on the scheduling system since the scheduler should choose the best zero‐dependent job that improves the performance of a grid system. This paper proposes two dependent job scheduling algorithms based on analyzing the effect of categorical and continuous variables of the job, which are used in the calculation of job weight. To find the job weight, twostep clustering is used with 10 groups and the ranking equation. In addition, to verify the ability to apply the proposed algorithms in a real environment, weighted least squares estimation is used. The results showed that the prediction rate is equal to 99.88%, which indicates that the proposed algorithms could be applied in a real grid system with low overhead. Through simulations and after testing the proposed algorithms, the average results showed that the Dependent Job Scheduling (DJS) algorithm outperformed the previous algorithms, in total execution time and an average waiting time with an improvement value of 1.18 and 1.92 times, respectively. While DJS algorithm with weighting factor (DJSJP) outperformed the previous algorithms in total execution time only with an improvement value equal to 1.17 times. The overall results indicated that the proposed algorithms are efficient to be used in a grid system, besides four bits are sufficient to improve the performance of the job scheduling system.