%0 Journal Article
%T Scheduling algorithm based on the priority and improved completion-time in grid<br>基于优先级和优化完成时间的网格调度算法
%A HE Yan
%A LI Ken-li
%A SHI Kui-ran
%A LIU Xiao-ling
%A WANG Ying
%A <br>何岩
%A 李肯立
%A 石岿然
%A 刘晓玲
%A 王颖
%J 计算机应用
%D 2006
%I 
%X Grid system consists of a wide variety of geographically distributed resources and these resources are heterogeneous,geographically distributed and dynamically available.High efficient scheduling algorithm would be able to increase throughput,maximize system utilization,and fulfill economical system and user constraints.Min-min algorithm is a simple and fast algorithm,and able to deliver good performance,but with the drawback of limitation of load balance.In this paper the transmission and execution of jobs were analyzed first.Then the completion time of the Min-min algorithm was computed and improved based on the schedule model.Furthermore,in order to improve the load balance of the Min-min algorithm,priority was assigned to the jobs according to different schedule limitations,and jobs were scheduled based on these priorities.Finally the POTE Min-min(Priority and Overlap Transmission and Execution Min-min) algorithm was proposed based on the analysis.
%K Grid
%K Min-min algorithm
%K completion time
%K priority<br>网格
%K Min-min算法
%K 完成时间
%K 优先级
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=94045850A5FF8BC8&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=CA4FD0336C81A37A&sid=1D0FA33DA02ABACD&eid=84FAE5A320B52DE7&journal_id=1001-9081&journal_name=计算机应用&referenced_num=1&reference_num=13