%0 Journal Article
%T CCTD:A Scheduling Algorithm under Communication Constraints for Fork-Join Task Graphs<br>CCTD：一种通信限制下的Fork-Join任务调度算法
%A LIANG Shan-shan WU Jia-jun ZHANG Jun-chao
%A <br>梁珊珊
%A 吴佳骏
%A 张军超
%J 计算机科学
%D 2009
%I 
%X All the complicated scheduling problems in modern parallel systems can be converted to the basic scheduling problem for Fork-Join task graphs.However,the communication between two processing nodes is carried on exclusively in real computation environment,which are normally ignored by most task scheduling algorithms.This paper presentsed a scheduling algorithm under communication constraints for Fork-Join task graphs.The algorithm provided a duplication based approach to schedule Fork-Join task graph while i...
%K fork-join<br>任务调度
%K 任务复制
%K 通信限制
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=02EB1653C1E40667686F0D5F018D04F8&yid=DE12191FBD62783C&vid=933658645952ED9F&iid=B31275AF3241DB2D&sid=4133DDB79B497495&eid=B8F8200D88DDC7D6&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=5