Name
Abstract | ||
|---|---|---|
A novel 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. Experimental results demonstrated that such an approach is quite effective. The proposed bottom-up hierarchical approach is computationally more effective than a global nonhierarchical one.<> |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1109/ICCAD.1991.185198 | Santa Clara, CA, USA |
Keywords | Field | DocType |
circuit layout CAD,graph theory,scheduling,bottom-up,conditional resource sharing,dataflow graphs,nested conditional branches,scheduling algorithm | Fair-share scheduling,Computer science,Flow shop scheduling,Two-level scheduling,Theoretical computer science,Least slack time scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Earliest deadline first scheduling,Round-robin scheduling | Conference |
Citations | PageRank | References |
52 | 5.88 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Taewhan Kim | 1 | 1087 | 113.31 |
| Jane W.-S. Liu | 2 | 1399 | 337.97 |
| C. L. Liu | 3 | 6191 | 970.79 |