.png){kind=icon}
返回
Sort-Mid tasks scheduling algorithm in grid computing
.png){kind=icon}
OA
AI
DOI：10.1016/j.jare.2014.11.010.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 2014 Production and hosting by Elsevier B.V. on behalf of Cairo University.
Keyword:
Grid computing
Heuristic algorithm
Scheduling
Resource utilization
Makespan
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13
论文数:
2.9K
被引数:
1.4W
机构
引用论文
.png){kind=icon}
没有更多内容
没有更多内容