Abstract
Compile-time scheduling of dynamic dataflow programs is still an open problem. This paper presents how scheduling of dynamic portions of asynchronous dataflow networks described using CAL language can be determined before execution by the analysis of the state space of network partitions. Experiments show that the number of run-time operations employed by dynamic schedulers is largely reduced when the schedules extracted by the state analysis are employed.
Original language | Undefined/Unknown |
---|---|
Title of host publication | 2012 IEEE International Conference on Acoustics, Speech and Signal Processing |
Publisher | IEEE |
Pages | 1661–1664 |
Number of pages | 4 |
ISBN (Print) | 978-1-4673-0045-2 |
DOIs | |
Publication status | Published - 2012 |
MoE publication type | A4 Article in a conference publication |
Event | IEEE International Conference on Acoustics, Speech and Signal Processing - IEEE International Conference on Acoustics, Speech and Signal Processing Duration: 25 Mar 2012 → 30 Mar 2012 |
Conference
Conference | IEEE International Conference on Acoustics, Speech and Signal Processing |
---|---|
Period | 25/03/12 → 30/03/12 |
Keywords
- Dataflow programming
- MPEG-4 decoder
- model checking