Mobility Overlap-Removal Based Timing-Constrained Scheduling
In the High-Level Synthesis (HLS), the scheduling is a key problem. Recently, the max-flow scheduling method is proposed for resource-constrained scheduling based on the mobility overlap removal. In the max-flow scheduling method, it is a hard problem how to remove the overlaps optimally. With an improper mobility overlap removal, there might be no feasible solutions with resource constraints. In this work, the mobility overlap removal-based method is extended to deal with timing-constrained scheduling problem, where the timing constraint is given as an input and the resource usage should be minimized. A simulated-annealing based method is used to explore the optimal mobility overlap removal. And, given the overlap-free mobilities, a convex-cost flow based algorithm is proposed to schedule single-cycle operations optimally. At the same time, greedy algorithms are devised to schedule multi-cycle operations. The experimental results show the effectiveness of the proposed method.
High-level Synthesis Scheduling
Song Chen Yuan Yao Takeshi Yoshimura
Graduate School of Information, Production, and Systems, Waseda University Hibikino 2-7, Wakamatsu, Kitakyushu, 808-0135, Japan
国际会议
2011 IEEE 9th International Conference on ASIC(2011年第九届IEEE国际专用集成电路大会)
厦门
英文
449-452
2011-10-25(万方平台首次上网日期,不代表论文的发表时间)