A new algorithm named TCR is developed to minimize the makespan by increasing computation resources utilization and task parallelism.
考虑到数据传输和计算的比例关系对元任务完成的影响，提出一种新的调度算法TCR，通过提高计算资源的利用率以及任务间的并行度，减少元任务的完成时间。
参考来源 - 期刊学术社区·2,447,543篇论文数据，部分数据来源于NoteExpress
No-idle flow shop(NIFS) problem with makespan criterion is studied.
研究了以最大完工时间为目标的零空闲流水线调度问题。
The minimum time that needs to execute a batch of tasks is called makespan.
若干台处理机完成一批任务所需要的最少时间称为完工时间。
A preemptive uniform machine scheduling problem with arrival time and minimum makespan is studied in this paper.
研究了可中断的带有到达时间的使总完工时间最小的恒速机排序问题。
应用推荐