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

In this paper, 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...

Full description

Saved in:
Bibliographic Details
Published inDesign, Automation, and Test in Europe Conference and Exhibition : proceedings, March 9-12, 1999, Munich, Germany pp. 568 - 573
Main Authors Jui-Ming Chang, Pedram, M.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1999
Subjects
Costs
Delay
Design engineering
Dynamic programming
Hardware
Humans
Libraries
Partitioning algorithms
Rivers
Time division multiplexing
Online AccessGet full text
ISBN9780769500782
0769500781
DOI10.1109/DATE.1999.761184

Cover

More Information
Summary:In this paper, 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. Experimental results are reported and discussed.
ISBN:9780769500782
0769500781
DOI:10.1109/DATE.1999.761184