We first presents an extended list scheduling algorithm which extends the classic list scheduling algorithm taking into account the routing and wavelength assignment for data communications.
首先，我们介绍扩展链表调度算法。这个算法在经典的链表调度算法中加入了为数据传输计算波长和路由的算法。
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)。
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)方式。
The result shows that the combining algorithm can arrive at worse code than ILP but better than list scheduling.
实验结果表明该联合算法得到的优化结果劣于整数线性规划算法，但是优于表调度算法。
The result shows that the combining algorithm can arrive at worse code than ILP but better than list scheduling.
实验结果表明该联合算法得到的优化结果劣于整数线性规划算法，但是优于表调度算法。
应用推荐