Abstract: The paper propose some improvements on the scheduling optimization algorithm under strong time constraints which bases on the associativity and distributivity properties of arithmetic operations. Combining the weakening of the conditions for basic operation transforms and recursion test, the methodology overcomes the shortcomings such as narrow application scope and low coming through possibility of similar algorithms.

摘要： 对基于操作的结合律与分配律进行变换的强时间约束条件下的调度算法提出了改进。通过弱化基本操作变换类型的发生条件并结合递归试探的方法，改善了直接应用特定基本操作变换类型的同类算法适用范围窄、容易调度失败的缺点。

关键词: 关键路径, 控制数据流图, 强时间约束, 结合律, 分配律

CLC Number: 

• TN702