Display options
Cite
Reda NM, Tawfik A, Marzok MA, et al. Sort-Mid tasks scheduling algorithm in grid computing. J Adv Res. 2014;6(6):987-93doi: 10.1016/j.jare.2014.11.010.
Reda, N. M., Tawfik, A., Marzok, M. A., & Khamis, S. M. (2015). Sort-Mid tasks scheduling algorithm in grid computing. Journal of advanced research, 6(6), 987-93. https://doi.org/10.1016/j.jare.2014.11.010
Reda, Naglaa M, et al. "Sort-Mid tasks scheduling algorithm in grid computing." Journal of advanced research vol. 6,6 (2015): 987-93. doi: https://doi.org/10.1016/j.jare.2014.11.010
Reda NM, Tawfik A, Marzok MA, Khamis SM. Sort-Mid tasks scheduling algorithm in grid computing. J Adv Res. 2015 Nov;6(6):987-93. doi: 10.1016/j.jare.2014.11.010. Epub 2014 Nov 26. PMID: 26644937; PMCID: PMC4642166.
Copy Download .nbib Format: NLM
Share it on

J Adv Res. 2015 Nov;6(6):987-93. doi: 10.1016/j.jare.2014.11.010. Epub 2014 Nov 26.

Sort-Mid tasks scheduling algorithm in grid computing.

Journal of advanced research

Naglaa M Reda, A Tawfik, Mohamed A Marzok, Soheir M Khamis

Affiliations

  1. Department of Mathematics, Faculty of Science, Ain Shams University, Cairo, Egypt.
  2. Egypt. Ctr. for Theo. Phys., Faculty of Engineering, Modern University, Cairo, Egypt.

PMID: 26644937 PMCID: PMC4642166 DOI: 10.1016/j.jare.2014.11.010

Abstract

Scheduling tasks on heterogeneous resources distributed over a grid computing system is an NP-complete problem. The main aim for several researchers is to develop variant scheduling algorithms for achieving optimality, and they have shown a good performance for tasks scheduling regarding resources selection. However, using of the full power of resources is still a challenge. In this paper, a new heuristic algorithm called Sort-Mid is proposed. It aims to maximizing the utilization and minimizing the makespan. The new strategy of Sort-Mid algorithm is to find appropriate resources. The base step is to get the average value via sorting list of completion time of each task. Then, the maximum average is obtained. Finally, the task has the maximum average is allocated to the machine that has the minimum completion time. The allocated task is deleted and then, these steps are repeated until all tasks are allocated. Experimental tests show that the proposed algorithm outperforms almost other algorithms in terms of resources utilization and makespan.

Keywords: Grid computing; Heuristic algorithm; Makespan; Resource utilization; Scheduling

Publication Types