Name
Abstract | ||
|---|---|---|
This paper describes an exact symbolic formulation of control-dependent, resource-constrained scheduling. The tech- nique provides a closed-form solution set in which all satisfying schedules are encapsulated in a compressed OBDD-based rep- resentation. This solution format greatly increases the flexibility of the synthesis task by enabling incremental incorporation of additional constraints and by supporting solution space explo- ration without the need for rescheduling. The technique provides a systematic treatment of speculative operation execution in arbitrary forward-branching controVdata paths. An iterative construction method is presented along with benchmark results. The experiments demonstrate the ability of the proposed tech- nique to efficiently exploit parallelism not explicitly specified in the input description. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1109/43.486271 | IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems |
Keywords | DocType | Volume |
closed-form solution,proposed technique,solution format,solution space exploration,OBDD-based representation,additional constraint,arbitrary forward-branching control,benchmark result,data path,exact symbolic formulation,control-dependent scheduling,new symbolic technique | Journal | 15 |
Issue | ISSN | Citations |
1 | 0278-0070 | 37 |
PageRank | References | Authors |
2.08 | 37 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ivan P. Radivojevic | 1 | 37 | 2.08 |
| Forrest Brewer | 2 | 414 | 62.95 |