In order to make up for the shortage of Min-Min in load balancing, a new task scheduling algorithm T-max-int Under the grid computing has been proposed in this paper. In T-max-int, the Loss Degree of max-int has been ...
详细信息
ISBN:
(纸本)9783038351559
In order to make up for the shortage of Min-Min in load balancing, a new task scheduling algorithm T-max-int Under the grid computing has been proposed in this paper. In T-max-int, the Loss Degree of max-int has been brought into Min-Min. T was in the form of percentage, which represents the proportion of selected tasks that have loss degree in the total tasks. Then, experiments of T have been taken to make Makespan the minimum. Finally, T-max-int, max-Min, Min-Min were compared, which proved that T-max-Min is better than the other two algorithms in aspects of Makespan and load balancing.
暂无评论