Codex-dp: Co-design of communicating systems using dynamic programming

被引:25
作者
Chang, JM [1 ]
Pedram, M
机构
[1] Hewlett Packard Labs, Palo Alto, CA 94304 USA
[2] Univ So Calif, Dept Elect Engn Syst, Los Angeles, CA 90089 USA
基金
美国国家卫生研究院;
关键词
D O I
10.1109/43.851989
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We present a novel algorithm based on dynamic programming with binning to find, subject to a given deadline, the minimum-cost coarse-grain hardware/software partitioning and mapping of communicating processes in a generalized task graph, The task graph includes computational processes which communicate with each other by means of blocking/nonblocking communication mechanisms at times including, but also other than, the beginning or end of their lifetime. The proposed algorithm has been implemented and experimental results are reported.
引用
收藏
页码:732 / 744
页数:13
相关论文
共 1 条
[1]  
[No title captured]