约束驱动与松弛时间消除相结合的硬/软件划分算法

硬/软件划分是硬/软件协同设计的关键问题之一．在分析了已经被提出的硬/软件划分算法中存在的问题之后，提出了一种基于约束驱动和松弛时间消除相结合的硬/软件划分算法．首先是获取结点面积—时间(A—T)曲线的方法，然后比较时间约束紧迫度与阈值的大小，决定结点是用硬件还是软件执行．硬/软件面积的约束紧迫度决定硬/软件执行面积，通过A—T曲线找出对应的执行时间．最后，消除结点之间存在的松弛时间进一步优化设计．

An Algorithm for Hardware/Software Partitioning Using Constraint-Driven and Elimination of Slack Time

One of the key problems in hardware/software co-design is hardware/software partitioning. The problems in the presented algorithms of hardware/software partitioning are analyzed and a new hardware/software partitioning algorithm is presented, based on the combination of the constraint-driven and elimination of slack time. First, an approach used to get area-time(A-T) curve of nodes is put forward. The nodes are mapped to hardware or software by comparing the value of time constraint criticality with threshold. Hardware/software executive areas are decided in terms of hardware/software areas constraints criticality, and then the executive time of nodes is obtained through A-T curve of nodes. Finally, the performance optimization is done further by eliminating slack time existing among nodes.