Abstract | ||
---|---|---|
This paper presents an approach allowing communication optimization during the hardware-software partitioning task. Our methodology focuses on systems represented by a data flow graph whose nodes are elements of libraries. To abstract the communication constraints, we include communication nodes in this graph. Consequently, assignment and scheduling of communications and operations can be determined together by the same partitioning algorithm. During partitioning, protocol optimization and bus scheduling are realized. We illustrate with a telecommunication system example the feasibility and the usefulness of our methodology. |
Year | DOI | Venue |
---|---|---|
1997 | 10.1109/HSC.1997.584582 | CODES |
Keywords | Field | DocType |
communication node,interface optimization,communication optimization,hardware-software partitioning task,communication constraint,hardware-software partitioning,protocol optimization,partitioning algorithm,data flow graph,bus scheduling,telecommunication system example,protocols,systems analysis,control systems,hardware,logic design,scheduling,scheduling algorithm,software engineering | Logic synthesis,Graph,Scheduling (computing),Computer science,Systems analysis,Data-flow analysis,Hardware software,Telecommunication computing,Distributed computing | Conference |
ISSN | ISBN | Citations |
1092-6100 | 0-8186-7895-X | 7 |
PageRank | References | Authors |
0.79 | 11 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Laurent Freund | 1 | 19 | 1.94 |
Denis Dupont | 2 | 7 | 0.79 |
Michel Israel | 3 | 7 | 0.79 |
Frederic Rousseau | 4 | 399 | 40.15 |