CCTD:A Scheduling Algorithm under Communication Constraints for Fork-Join Task Graphs
CCTD：一种通信限制下的Fork-Join任务调度算法

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...