| New Model and Algorithm for Hardware/Software Partitioning |
| |
| 作者姓名： | Ji-Gang Wu Thambipillai Srikanthan and Guang-Wei Zou |
| |
| 作者单位： | Centre for High Performance Embedded Systems，School of Computer Engineering，Nanyang Technological University |
| |
| 摘 要： | This paper focuses on the algorithmic aspects for the hardware/software （HW/SW） partitioning which searches a reasonable composition of hardware and software components which not only satisfies the constraint of hardware area but also optimizes the execution time. The computational model is extended so that all possible types of communications can be taken into account for the HW/SW partitioning. Also, a new dynamic programming algorithm is proposed on the basis of the computational model, in which source data, rather than speedup in previous work, of basic scheduling blocks are directly utilized to calculate the optimal solution. The proposed algorithm runs in O（n·A） for n code fragments and the available hardware area A. Simulation results show that the proposed algorithm solves the HW/SW partitioning without increase in running time, compared with the algorithm cited in the literature.
|
| 关 键 词： | 算法 模型 硬件 软件 动态编程 |
New Model and Algorithm for Hardware/Software Partitioning |
| |
| Ji-Gang Wu,Thambipillai Srikanthan,and Guang-Wei Zou.New Model and Algorithm for Hardware/Software Partitioning[J].Journal of Computer Science and Technology,2008,23(4):644-651. |
| |
| Authors: | Ji-Gang Wu Thambipillai Srikanthan Guang-Wei Zou |
| |
| Affiliation: | (1) Centre for High Performance Embedded Systems, School of Computer Engineering, Nanyang Technological University, Singapore, 639798, Singapore |
| |
| Abstract: | This paper focuses on the algorithmic aspects for the hardware/software (HW/SW) partitioning which searches a reasonable composition
of hardware and software components which not only satisfies the constraint of hardware area but also optimizes the execution
time. The computational model is extended so that all possible types of communications can be taken into account for the HW/SW
partitioning. Also, a new dynamic programming algorithm is proposed on the basis of the computational model, in which source
data, rather than speedup in previous work, of basic scheduling blocks are directly utilized to calculate the optimal solution.
The proposed algorithm runs in O(n ⋅ A) for n code fragments and the available hardware area A. Simulation results show that the proposed algorithm solves the HW/SW partitioning without increase in running time, compared
with the algorithm cited in the literature.
Electronic supplementary material The online version of this article (doi:) contains supplementary material, which is available to authorized users. |
| |
| Keywords: | algorithm hardware/software partitioning dynamic programming complexity |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
| 点击此处可从《计算机科学技术学报》浏览原始摘要信息 |
|
点击此处可从《计算机科学技术学报》下载全文 |
