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

We present a novel algorithm based on dynamic programming with binning to f ind, subject to a given deadline, the minimum-cost coarse-grain hardware/so ftware partitioning and mapping of communicating processes in a generalized task graph, The task graph includes computational processes which communic ate with each other by means of blocking/nonblocking communication mechanis ms at times including, but also other than, the beginning or end of their l ifetime. The proposed algorithm has been implemented and experimental resul ts are reported.