Abstract

This study addresses a duplication based scheduling algorithm called Effective Scheduling based on Task Duplication (ESTD) for grid computing environment. Duplications are made based on task dependencies. The algorithm ensures beneficial duplications and avoids unnecessary duplications. Idle time slots between task execution times are effectively used. The algorithm aims to avoid the communication contention, which will happen when there is frequent transportation of large sets of data. The performance of the algorithm is scaled by comparing it with the algorithms of its kind. The results show minimized make span and effective resource utilization with balanced loads across resources in grid.

Keywords:

Active scheduling, duplication mechanism, forward directive, include directive, load balancing, passive scheduling , work flow,

References

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.