摘要
将0-1规划算法应用于软硬件协同划分过程中,一种节点的映射方式对应单位立方体上的一个顶点。利用单位立方体几何性质求出无约束的目标最优解;由此解出发,利用折半查找和一定的编码策略向外搜索,直到满足系统约束为止;利用仿真数据对该算法进行了有效性验证。仿真结果表明,0-1算法的收敛速度与遗传算法相当;精度与整线性规划相当。
This paper proposes an innovative 0-1 partitioning algorithm (named 0-1 algorithm) over IP cores which can efficiently partition an expected system into hardware or software parts. The correctness of the 0-1 algorithm is verified. It is illustrated that the result of optimization using the algorithm is better than using genetic algorithm, with similar convergence speed. In addition, this algorithm has the advantage that its convergence is quicker than the Integer Linear Programming (ILP) approach.
出处
《电子科技大学学报》
EI
CAS
CSCD
北大核心
2007年第3期594-597,共4页
Journal of University of Electronic Science and Technology of China
关键词
0-1规划
软硬件划分
软硬协同设计
0-1 algorithm
hardware-software co-partition
hardware-software co-design