Sammanfattning
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.
Originalspråk | Odefinierat/okänt |
---|---|
Titel på värdpublikation | 2012 IEEE International Conference on Acoustics, Speech and Signal Processing |
Förlag | IEEE |
Sidor | 1661–1664 |
Antal sidor | 4 |
ISBN (tryckt) | 978-1-4673-0045-2 |
DOI | |
Status | Publicerad - 2012 |
MoE-publikationstyp | A4 Artikel i en konferenspublikation |
Evenemang | IEEE International Conference on Acoustics, Speech and Signal Processing - IEEE International Conference on Acoustics, Speech and Signal Processing Varaktighet: 25 mars 2012 → 30 mars 2012 |
Konferens
Konferens | IEEE International Conference on Acoustics, Speech and Signal Processing |
---|---|
Period | 25/03/12 → 30/03/12 |
Nyckelord
- Dataflow programming
- MPEG-4 decoder
- model checking