摘要
动态部分重构的特性大大提高了硬件设计的灵活性,但传统的软硬件划分算法不再适用于针对这类硬件的系统设计。部分研究考虑了动态部分重构的特性,并建立了混合整数线性规划(MILP)模型进行求解。但是由于MILP自身的限制,求解时间特别长,只能处理规模较小的问题。为了能够处理规模较大的问题,并且缩短求解时间,该文对MILP方法进行了详细的分析,并且通过启发式算法确定部分关键任务的状态,从而减小MILP的规模,加快求解速度。实验结果表明:与传统的数学规划方法相比,在求解质量不变的情况下,该算法可以得到最高约200倍的速度提升。
More and more hardware platforms are providing dynamic partial reconfiguration; thus, traditional hardware/software partitioning algorithms are no longer applicable.Some studies have analyzed the dynamic partial reconfiguration as mixed-integer linear programming（MILP）models to get solutions.However,the MILP models are slow and can only handle small problems.This paper uses heuristic algorithms to determine the status of some critical tasks to reduce the scale of the MILP problem for large problems.Tests show that this method is about 200 times faster with the same solution quality as the traditional mathematical programming method.
出处
《清华大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2016年第3期246-252,261,共8页
Journal of Tsinghua University(Science and Technology)
关键词
软硬件划分
动态部分重构
启发式
混合整数线性规划
HW/SW partitioning
dynamic partial reconfiguration
heuristic method
mixed-integer linear programming（MILP）
