Automata-based symbolic scheduling for looping DFGs

This paper presents an exact technique for scheduling looping data-flow graphs that implicitly supports functional pipelining and loop winding. Automata-based symbolic modeling provides efficient representation of all causal executions of a given behavioral description subject to finite state bounds...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on computers Vol. 50; no. 3; pp. 250 - 267
Main Authors Haynal, S., Brewer, F.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.03.2001
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Automata
Automation
Benchmarks
Boolean functions
Computational efficiency
Data structures
Exploration
High level synthesis
Job shop scheduling
Mathematical analysis
Mathematical models
Microprocessors
Pipeline processing
Protocols
Refining
Representations
Scheduling
Timing
Online AccessGet full text

Cover

More Information
Summary:This paper presents an exact technique for scheduling looping data-flow graphs that implicitly supports functional pipelining and loop winding. Automata-based symbolic modeling provides efficient representation of all causal executions of a given behavioral description subject to finite state bounds. Since a complete set of scheduling solutions is found, further incremental refinements, such as sequential interface protocol constraints, can be easily accommodated. Efficiency In the implementation Is maintained by careful formulation of the automata and by judicious exploration techniques. Results are presented for traditionally referenced benchmarks, several large synthetic benchmarks, and a practical industrial example.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:0018-9340
1557-9956
DOI:10.1109/12.910815