An efficient list-based scheduling algorithm for high-level synthesis
An efficient list-based scheduling algorithm for high-level synthesis
复制标题
一种高效的基于列表的高级综合调度算法
DOI：
--
复制
发表时间：
2002
期刊：
影响因子：
--
通讯作者：
V. Drábek
中科院分区：
文献类型：
--
作者：
A. M. Sllame;V. Drábek
调度被认为是高级综合过程中最重要的任务。本文提出了一种新的基于列表的调度算法，该算法利用从数据流图（DFG）结构中提取的一些信息来指导调度程序快速找到接近最优/最优调度。我们开发了一种基于DFG分析的新方法，该方法完全在准备阶段完成。这个DFG分析信息包括：每个节点知道它的后继节点和前导节点，后继节点的总数，以及它所属的树，其中树是根据构造的DFG的每个输出操作构造的。将这些知识结合到调度程序的优先级函数中，可以指导调度程序正确选择下一步要调度的完美操作。
Scheduling is considered as the most important task in high-level synthesis process. This paper presents a novel list-based scheduling algorithm based on incorporating some information extracted from data flow graph (DFG) structure to guide the scheduler to find near-optimal/optimal schedules quickly. We have developed a novel approach based on DFG analysis that is totally done as preparation phase. This DFG analysis information includes: every node knows its successor and its predecessor, total number of successors, and the tree which it belongs to, where trees are constructed from every output operation from the constructed DFG. Incorporating this knowledge in the priority functions of the scheduler guided the scheduler to make the correct choice of the perfect operation to be scheduled next.