| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428437 | Information Processing Letters | 2006 | 6 Pages |
Abstract
A low-complex algorithm is proposed for the hardware/software partitioning. The proposed algorithm employs dynamic programming principles while accounting for communication delays. It is shown that the time complexity of the latest algorithm has been reduced from O(n2⋅A) to O(n⋅A), without increase in space complexity, for n code fragments and hardware area A.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
