Name
Abstract | ||
|---|---|---|
Generalizes ALAP (as late as possible) bounds for the exact scheduling problem on a pre-defined data path. Conventional bounds are inapplicable because of the possible requirement of re-computing operands for minimal schedule length. Efficient techniques are presented for constructing the new bounds which are sensitive to point-to-point delays via transitive memory units. An efficient operand mapping bound is also described. Based on these two bounds, time improvement factors of 50 have demonstrated in exact scheduling results. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1145/266388.266479 | ICCAD |
Keywords | Field | DocType |
alap bounds,generalizes alap,conventional bound,operand recomputation,efficient technique,register transfer level symbolic execution,binding bounds,efficient operand mapping bound,exact scheduling problem,pre-defined data path,point-to-point delays,new bound,processor scheduling,rt-level symbolic execution,binding bound,exact scheduling result,transitive memory units,minimal schedule length,as-late-as-possible bounds,possible requirement,time improvement factors,efficient operand mapping,point to point,scheduling problem,register transfer level,minimisation,high level synthesis | Job shop scheduling,Scheduling (computing),Computer science,Data path,Parallel computing,High-level synthesis,Operand,Theoretical computer science,Real-time computing,Minimisation (psychology),Symbolic execution,Transitive relation | Conference |
ISBN | Citations | PageRank |
0-8186-8200-0 | 4 | 0.54 |
References | Authors | |
4 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chuck Monahan | 1 | 20 | 2.37 |
| Forrest Brewer | 2 | 414 | 62.95 |