寄存器分配之后，就能将依赖建立在真实的寄存器上，使用列表调度算法(list scheduling algorithm),这种策略在向前和向后两个方向上都能进行。
基于12个网页-相关网页
As a heuristic scheduling algorithm,list scheduling algorithm has better performance and lower time complexity.
表调度算法是解决此类问题的一种经典启发式任务调度算法,具有调度性能较好,时间复杂度较低等优点。
参考来源 - 基于动态通信竞争的任意处理机网络表调度算法·2,447,543篇论文数据，部分数据来源于NoteExpress
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)方式。
应用推荐