The result shows that the combining algorithm can arrive at worse code than ILP but better than list scheduling.
实验结果表明该联合算法得到的优化结果劣于整数线性规划算法，但是优于表调度算法。
The algorithm is based on the list scheduling principle by developing job sequences for the first stage and queuing the remaining stages in a FIFO manner.
所提出的算法基于表调度原理，首先给出在第一级工件的排列顺序，并在其后的各级采用先入先出(FIFO)方式。
This paper describes how to carry out task mapping and scheduling in heterogeneous computing system (HCS) using list scheduling algorithms.
研究了在异构计算系统(HCS)中利用表调度式算法进行任务映射与调度。
This paper brings the list scheduling method into the tasking allocation problem on an unbounded number of processors. The proposed algorithm is called node - transferring scheduling algorithm (NTSA).
文章提出了一种处理机个数无限的任务分配的列表调度算法，称之为节点迁移调度算法(ntsa)。
List scheduling can produce more satisfactory solutions at significantly lower cost than other approaches.
列表调度方法与其它方法相比，可以用较少的开销获得更好的结果。
List scheduling can produce more satisfactory solutions at significantly lower cost than other approaches.
列表调度方法与其它方法相比，可以用较少的开销获得更好的结果。
应用推荐