Title :
Scheduling and binding bounds for RT-level symbolic execution
Author :
Monahan, C. ; Brewer, F.
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA
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.
Keywords :
data flow graphs; high level synthesis; minimisation; processor scheduling; symbol manipulation; ALAP bounds; as-late-as-possible bounds; binding bounds; efficient operand mapping bound; exact scheduling problem; minimal schedule length; operand recomputation; point-to-point delays; pre-defined data path; register transfer level symbolic execution; time improvement factors; transitive memory units; Processor scheduling;
Conference_Titel :
Computer-Aided Design, 1997. Digest of Technical Papers., 1997 IEEE/ACM International Conference on
Conference_Location :
San Jose, CA, USA
Print_ISBN :
0-8186-8200-0
DOI :
10.1109/ICCAD.1997.643525
