山东商业职业技术学院学报
山東商業職業技術學院學報
산동상업직업기술학원학보
JOURNAL OF SHANDONG INSTITUTE OF COMMERCE AND TECHNOLOGY
2012年
4期
85-87,96
,共4页
网格调度%优先级%性价比%Min-Min
網格調度%優先級%性價比%Min-Min
망격조도%우선급%성개비%Min-Min
grid schedule%priority%perform - cost%Min - Min
网格任务调度算法是一个复杂的算法,并且被认为是一个NP难问题,在分析该算法的基础上,指出该算法的缺点:负载不均衡,算法的经济效益比较高以及不能兼顾到任务的紧迫程度,因此,从经济效益和优先级角度改进该算法,通过建立数学模型的方法,证明了改进后的算法能够在一定程度上均衡负载,并且也降低了算法调度过程中的费用问题,还满足了优先级高的任务的需求,从总体上来说,该算法提高了算法的效率,并提高了网络的整体性能。
網格任務調度算法是一箇複雜的算法,併且被認為是一箇NP難問題,在分析該算法的基礎上,指齣該算法的缺點:負載不均衡,算法的經濟效益比較高以及不能兼顧到任務的緊迫程度,因此,從經濟效益和優先級角度改進該算法,通過建立數學模型的方法,證明瞭改進後的算法能夠在一定程度上均衡負載,併且也降低瞭算法調度過程中的費用問題,還滿足瞭優先級高的任務的需求,從總體上來說,該算法提高瞭算法的效率,併提高瞭網絡的整體性能。
망격임무조도산법시일개복잡적산법,병차피인위시일개NP난문제,재분석해산법적기출상,지출해산법적결점:부재불균형,산법적경제효익비교고이급불능겸고도임무적긴박정도,인차,종경제효익화우선급각도개진해산법,통과건립수학모형적방법,증명료개진후적산법능구재일정정도상균형부재,병차야강저료산법조도과정중적비용문제,환만족료우선급고적임무적수구,종총체상래설,해산법제고료산법적효솔,병제고료망락적정체성능。
Task scheduling algorithm in the grid environment is a complex algontlam, anO is cons~cterea to De an NP hard problem. On the basis of this algorithm, this article points out the defect of the algorithm : not balancing the load, economic benefits relatively high and not taking into account the degree of urgency task. Therefore, this article improves the algorithm from the angle of economic benefits and priority, through the method of the establishment of the mathematical model. It is proved that the improved algorithm can load balancing to a certain extent, and also reduces the scheduling process costs, but also meets the high priority task demand. On the whole, the algorithm improves the efficiency of the algorithm , and improves the network overall performance