Automata-based symbolic scheduling for looping DFGs

IEEE Transactions on Computers

Volumn 50, Issue 3, 2001, Pages 250-267

  Haynal, Steve ^a,b   Brewer, Forrest ^a,c  

^a IEEE   (United States)

^b INTEL CORPORATION   (United States)

^c University of California   (United States)

Author keywords

Automata; Binary decision diagrams; High level synthesis; Loop pipelining; Nondeterminism; Scheduling; Symbolic model

Indexed keywords

BINARY DECISION DIAGRAMS; DATA FLOW GRAPH; JUDICIOUS EXPLORATION TECHNIQUES; LOOP PIPELINING; NONDETERMINISM;

CONSTRAINT THEORY; DATA FLOW ANALYSIS; FINITE AUTOMATA; NETWORK PROTOCOLS;

SCHEDULING;

EID: 0035271966     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.910815     Document Type: Article

References (24)

1. Rotation scheduling: A loop pipelining algorithm
2. Dynamic scheduling and synchronization synthesis of concurrent digital systems under system-level constraints
3. A code-motion pruning technique for global scheduling
4. Throughput optimized architectural synthesis
5. Loop winding-a data flow approach to functional pipelining
6. Loop optimization in register-transfer scheduling for DSP-systems
7. Efficient encoding for exact symbolic automata-based scheduling
8. Model for scheduling protocol-constrained components and environments
9. Automata-based symbolic scheduling
10. Zone scheduling
11. Wavesched: A novel scheduling technique for control-flow intensive designs
12. A transformation-based method for loop folding
13. A new approach to pipeline optimisation
14. Scheduling and binding bounds for RT-level symbolic execution
15. Force-directed scheduling for the behavioral synthesis of ASICs
16. Optimizing resource utilization using transformations
17. A new symbolic technique for control-dependent scheduling
18. Symbolic scheduling techniques
19. Time-constrained loop pipelining
20. An automaton model for scheduling constraints in synchronous machines
21. High-level DSP synthesis using concurrent transformations, scheduling, and allocation
22. Scheduling and control generation with environmental constraints based on automata representations