Improved Min-Min Algorithm Research Based on Grid Computing
The grid computing is a new computing pattern which produced along with the Internet development The task scheduling is one of the central contents of grid computing. As a classical heuristic algorithm, Min—Min is easy to cause the longer tasks waiting too long or even starve to death, because it always scheduled shorter task earlier. In this respect, this paper proposes WeiS—Min-Min algorithm, which introduces the concept of task dynamic priority, its initial value is assigned by User and is increased as the waiting time increase. WeiS—Min-Min combines the dynamic priority and Min-Min algorithm. In the beginning of every scheduling cycle in WeiS—Min-Min, all the tasks minimum completion time and priority are calculated, and then normalized and weighted summation, at last, they are scheduled according to the weighted sum. The improvement reduces the average waiting time much through example proofs.
Component Grid Computing Scheduling Algorithm Dynamic Priority Weighted Sum
Liu Haihui
College of Computer and Communication Engineering Weifang University Weifang, China
国际会议
太原
英文
354-357
2011-02-26（万方平台首次上网日期，不代表论文的发表时间）