%0 Journal Article
%T SW/HW partition algorithm research based on improved 0-1 dynamic programming<br>基于改进0-1动态规划的软硬件划分算法研究*
%A ZHAO Quan-wei
%A WU Qiang
%A LIU Jie
%A <br>赵全伟
%A 吴强
%A 刘杰
%J 计算机应用研究
%D 2011
%I 
%X SW/HW partition has been proved to be NP-completeness. Most studies concentrate on the seeking for various rapid approximate algorithms, among which are common include: hill-climbing method, genetic algorithm, simulated annealing(SA), etc. However, most of these algorithms can only solve problems with small-scale, and which study the problem of SW/HW partition solely on algorithmic aspect, without considering the system cost. Based on the uniform abstract model of SW/HW co-function-library, this paper incorporated some factors into 0-1 dynamic programming algorithm, which included system execution time, system cost and hardware area. Then, obtained the partition plan by improving the computing method of 0-1 dynamic programming algorithms according to practical situation. At last, experiments validate the correctness and effectiveness.
%K SW/HW partition
%K 0-1 dynamic programming
%K FPGA(field programmable gate array)<br>软硬件划分
%K 0-1动态规划
%K 现场可编程门阵列
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=1F8EB868F38CE0727B80A9E54F9AECB8&yid=9377ED8094509821&vid=D3E34374A0D77D7F&iid=F3090AE9B60B7ED1&sid=769DA7877E6F8E5C&eid=EE63B76F606255DF&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=7