Min-cut based leakage power aware scheduling in high-level synthesis
Min-cut based leakage power aware scheduling in high-level synthesis
复制标题
DOI：
10.1109/isqed.2013.6523605
复制
发表时间：
2013-03
期刊：
影响因子：
--
通讯作者：
Nan Wang;Song Chen;T. Yoshimura
中科院分区：
文献类型：
--
作者：
Nan Wang;Song Chen;T. Yoshimura
在本文中，我们解决的问题，调度操作到控制步骤与双阈值电压（双Vth）技术下的时间和资源的限制。提出了一种基于最小割的泄漏功率优化算法。该算法首先将所有的操作切换到高Vth，然后通过将覆盖所有关键路径的操作集合重新分配到低Vth来迭代地缩短关键路径延迟，直到满足时序约束。一个修改的力导向调度实现调度操作，并调整阈值电压分配与资源约束的考虑。在此过程中，迁移率重叠图（MOG）的基础上构建的高Vth操作的迁移率。通过计算MOG的最小割集来调整操作的阈值电压，以保证满足资源约束。实验结果表明，我们的方法在运行时间和泄漏功率降低比MWIS_heuristic [3]。
In this paper, we address the problem of scheduling operations into control steps with dual threshold voltage (dual-Vth) technique under timing and resource constraints. We present a min-cut based algorithm for leakage power optimization. The proposed algorithm first initializes all the operations to high-Vth, then iteratively shorten the critical path delay by reassigning the set of operations covering all the critical paths to low-Vth until the timing constraints are met. A modified force-directed scheduling is implemented to schedule operations and to adjust threshold voltage assignments with consideration of resource constraints. During this procedure, mobility overlap graph (MOG) is constructed based on the mobilities of high-Vth operations. To guarantee the resource constraints are satisfied, operations' threshold voltages are adjusted by computing the min-cut of MOG. Experimental results show that our method performs better both in running time and leakage power reduction compared with MWIS_heuristic [3].