![](images/graphics/blank.gif)
NP-complete problems
-
Scheduling tasks on heterogeneous resources distributed over a grid computing system is an NPcomplete 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.
7p
trinhthamhodang1
16-11-2019
23
1
Download
-
Many problems of practical significance are NPcomplete but are too important to abandon merely because obtaining an optimal solution is intractable (khó). If a problem is NP-complete, we are unlikely to find a polynomial time algorithm for solving it exactly, but it may still be possible to find near-optimal solution in polynomial time.
22p
lucky156
04-06-2010
209
18
Download
CHỦ ĐỀ BẠN MUỐN TÌM
![](images/graphics/blank.gif)