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

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 communic...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on computer-aided design of integrated circuits and systems Vol. 19; no. 7; pp. 732 - 744
Main Authors Jui-Ming Chang, Pedram, M.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.07.2000
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Algorithms
Communicating
Communication system control
Communication system software
Dynamic programming
Dynamic scheduling
Dynamical systems
Dynamics
Graphs
Hardware
Heuristic algorithms
Humans
Libraries
Partitioning algorithms
Software algorithms
Tasks
Online AccessGet full text
ISSN0278-0070
1937-4151
DOI10.1109/43.851989

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:0278-0070
1937-4151
DOI:10.1109/43.851989