SCHEDULING OF DYNAMIC DATAFLOW PROGRAMS BASED ON STATE SPACE ANALYSIS

A4 Konferenspublikationer


Interna författare/redaktörer


Publikationens författare: Ersfolk J, Roquier G, Lilius J, Mattavelli M
Publiceringsår: 2012
Förläggare: IEEE
Moderpublikationens namn: 2012 IEEE International Conference on Acoustics, Speech and Signal Processing
Artikelns första sida, sidnummer: 1661
Artikelns sista sida, sidnummer: 1664
Antal sidor: 4
ISBN: 978-1-4673-0045-2


Abstrakt

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.


Nyckelord

Dataflow programming, model checking, MPEG-4 decoder

Senast uppdaterad 2019-17-10 vid 02:48