|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
27th ACM/IEEE Design Automation Conference (DAC '90)
Orlando, FL, USA
June 24-June 28
ISBN: 0-89791-363-9
| ASCII Text | x | ||
| Camposano, Bergamaschi, "Synthesis using path-based scheduling: algorithms and exercises," Design Automation Conference, pp. 450-455, 27th ACM/IEEE Design Automation Conference (DAC '90), 1990. | |||
| BibTex | x | ||
| @article{ 10.1109/DAC.1990.114898, author = { Camposano and Bergamaschi}, title = {Synthesis using path-based scheduling: algorithms and exercises}, journal ={Design Automation Conference}, volume = {0}, year = {1990}, isbn = {0-89791-363-9}, pages = {450-455}, doi = {http://doi.ieeecomputersociety.org/10.1109/DAC.1990.114898}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Design Automation Conference TI - Synthesis using path-based scheduling: algorithms and exercises SN - 0-89791-363-9 SP450 EP455 A1 - Camposano, A1 - Bergamaschi, PY - 1990 KW - path based scheduling KW - heuristic solutions KW - algorithms KW - sequences KW - operations KW - control-flow graph KW - high-level synthesis KW - optimization KW - exact algorithm KW - benchmarks VL - 0 JA - Design Automation Conference ER - | |||
Path-based scheduling algorithms consider all possible sequences of operations (called paths) in a control-flow graph. Unlike most scheduling techniques used in high-level synthesis they stress optimization across conditional branches. Several path-based algorithms are presented. An exact algorithm finds the minimum number of control steps required for each possible path being executed. Heuristic solutions are also implemented. Extensive application of these algorithms to the benchmarks of the high-level synthesis workshop shows the practical feasibility of such methods.
Index Terms:
path based scheduling, heuristic solutions, algorithms, sequences, operations, control-flow graph, high-level synthesis, optimization, exact algorithm, benchmarks
Citation:
Camposano, Bergamaschi, "Synthesis using path-based scheduling: algorithms and exercises," dac, pp.450-455, 27th ACM/IEEE Design Automation Conference (DAC '90), 1990
Usage of this product signifies your acceptance of the Terms of Use.