动态选择时钟的资源约束下调度算法

为拓展数据流综合可搜索解空间,使资源约束下的调度结果更加接近全局最优,提出一种动态选择时钟周期的资源约束下调度算法.在资源约束调度过程中,通过对单周期、多周期和链式操作进行组合来计算备选时钟;在调度过程中选择能够充分利用元件资源,并可减小数据通道延迟时间的时钟周期,最终完成最佳时钟下的资源约束下调度.该算法将资源约束的影响引入时钟周期的选择,可得到能够真正提高性能的最优时钟;在时钟选择过程中完成资源约束下调度,使调度和时钟选择同时完成,保证调度结果的全局最优性.实验结果表明,采用文中算法得到的时钟周期和调度结果保证了资源约束条件下的数据通道延时最小.

An Algorithm for Resource Constrained Scheduling with Clock Selection

To expand the solution space that can be explored by data flow synthesis,and to obtain globally optimized scheduling results under resource constraints,an algorithm for resource constrained scheduling with clock selection is proposed.The single cycle operations,multi-cycle operations and chained operations can be constituted to calculate the candidate clock periods.When scheduling is under way,the proper clock period that can make the resource utilized adequately and the latency of data-path decreased will ...