%0 Journal Article
%T A New Algorithm for Scheduling Out-Tree Task Graph<br>一个调度Out-Tree任务图的新算法
%A ZHANG Yan
%A LI Yan-hong
%A <br>张艳
%A 李延红
%J 计算机应用
%D 2006
%I 
%X The schedule research of Out-Tree task graphs can effectively solve parallel computation of divide-and-conquer problem. For this kind of task graphs, a new scheduling algorithm was proposed. First new definition for each task was introduced, then the priority of each task based on the definition was computed, the schedule carried on. During scheduling, in order to save processors, the nodes were allocated to the used processors as far as possible without changing the scheduling length. The experiment shows that the proposed algorithm has better scheduling performance than the other algorithms.
%K task scheduling
%K Out-Tree task graph
%K scheduling length<br>任务调度
%K Out-Tree任务图
%K 调度长度
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=03B150AB517ADD84&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=94C357A881DFC066&sid=ADA74056AD01F4A8&eid=4E3541241257D204&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=9