Name
Title | ||
|---|---|---|
A scheduling algorithm for conditional resource sharing-a hierarchical reduction approach |
Abstract | ||
|---|---|---|
A new scheduling algorithm for dataflow graphs with nested conditional branches is presented. The algorithm employs a bottom-up approach to transform a dataflow graph with conditional branches into an “equivalent” one that has no conditional branches. A schedule is then obtained for the latter, using a conventional scheduling algorithm, from which a schedule for the former is derived. Our approach is particularly effective when there is a large number of nested conditional branches in a dataflow graph |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1109/43.275353 | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems |
Keywords | DocType | Volume |
nested conditional branches,conventional scheduling algorithm,bottom-up approach,scheduling,conditional resource sharing-a,logic CAD,nested conditional branch,dataflow graphs,dataflow graph,scheduling algorithm,conditional resource sharing,VLSI design,resource allocation,large number,hierarchical reduction approach,new scheduling algorithm,VLSI,circuit CAD,graph theory,conditional branch,high level synthesis | Journal | 13 |
Issue | ISSN | Citations |
4 | 0278-0070 | 24 |
PageRank | References | Authors |
1.37 | 3 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| T. Kim | 1 | 24 | 1.37 |
| N. Yonezawa | 2 | 24 | 1.37 |
| J. W.-S. Liu | 3 | 451 | 34.30 |
| C. L. Liu | 4 | 6191 | 970.79 |