DocumentCode :
2551207
Title :
Representing and scheduling looping behavior symbolically
Author :
Haynal, Steve ; Brewer, Forrest
Author_Institution :
California Univ., Santa Barbara, CA, USA
fYear :
2000
fDate :
2000
Firstpage :
552
Lastpage :
555
Abstract :
This paper presents a very general, exact technique for scheduling looping data-flow graphs. In contrast to the conventional technique using loop iteration variables and integer linear programming, the new technique uses implicit symbolic automata techniques to represent the problem instance. The new technique has several advantages, such as incremental refinement, efficient variable usage and ability to accommodate practical design constraints. A small case study demonstrates the flexibility and viability of this technique
Keywords :
automata theory; data flow graphs; processor scheduling; symbol manipulation; data-flow graphs; implicit symbolic automata; incremental refinement; loop iteration variables; looping behavior scheduling; problem instance; Automata; Delay; Flow graphs; Hardware; High level synthesis; Integer linear programming; Pipeline processing; Potential well; Protocols; Timing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Design, 2000. Proceedings. 2000 International Conference on
Conference_Location :
Austin, TX
ISSN :
1063-6404
Print_ISBN :
0-7695-0801-4
Type :
conf
DOI :
10.1109/ICCD.2000.878339
Filename :
878339
Link To Document :
بازگشت