DocumentCode
2074274
Title
A branch-and-bound method for optimal transformation of data flow graphs for observing hardware constraints
Author
Grass, Werner
Author_Institution
Passau Univ., Germany
fYear
1990
fDate
12-15 Mar 1990
Firstpage
73
Lastpage
77
Abstract
The paper introduces a new branch-and-bound-method which produces a data path from a given procedural behavior description observing precise hardware constraints and minimizing the execution time of the hardware algorithm to be implemented. The method starts with a maximal parallel flow graph and establishes supplementary edges in the graph to such an extent that the hardware constraints are observed for all deducible implementations of the resulting flow graphs
Keywords
graph theory; logic CAD; branch-and-bound method; data flow graphs; data path; edges; execution time minimization; hardware algorithm; hardware constraints; maximal parallel flow graph; optimal transformation; procedural behavior description; Algorithm design and analysis; Cost function; Flow graphs; Hardware; Prototypes; Scheduling algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation Conference, 1990., EDAC. Proceedings of the European
Conference_Location
Glasgow
Print_ISBN
0-8186-2024-2
Type
conf
DOI
10.1109/EDAC.1990.136623
Filename
136623
Link To Document