Efficient formulation for optimal modulo schedulers
Efficient formulation for optimal modulo schedulers
复制标题
最佳模调度器的有效公式
DOI：
--
复制
发表时间：
1997
期刊：
影响因子：
--
通讯作者：
E. Davidson
中科院分区：
文献类型：
--
作者：
A. Eichenberger;E. Davidson
已经提出了基于最佳求解器的Modulo调度算法，以调查和调整Modulo调度启发式方法的性能。尽管最近的进步扩大了最佳方法适用的范围，但这种方法越来越多地遭受了大量执行时间的影响。在本文中，我们提出了更有效的Modulo调度空间的公式，该公式大大减少了基于整数线性程序的求解器的执行时间。例如，当使用更有效的配方而不是传统配方，安排了从完美俱乐部，Spec和Livermore Fortran内核的782个循环时，总执行时间减少了8.6倍。实验证据进一步表明，可以在逼真的机器限制下安排更大的循环。
Modulo scheduling algorithms based on optimal solvers have been proposed to investigate and tune the performance of modulo scheduling heuristics. While recent advances have broadened the scope for which the optimal approach is applicable, this approach increasingly suffers from large execution times. In this paper, we propose a more efficient formulation of the modulo scheduling space that significantly decreases the execution time of solvers based on integer linear programs. For example, the total execution time is reduced by a factor of 8.6 when 782 loops from the Perfect Club, SPEC, and Livermore Fortran Kernels are scheduled for minimum register requirements using the more efficient formulation instead of the traditional formulation. Experimental evidence further indicates that significantly larger loops can be scheduled under realistic machine constraints.