Scheduling of dynamic dataflow programs with model checking

A4 Konferenspublikationer


Interna författare/redaktörer


Publikationens författare: Johan Ersfolk, Ghislain Roquier, Fareed Jokhio, Johan Lilius, Marco Mattavelli
Publiceringsår: 2011
Tidskrift: 2011 IEEE WORKSHOP ON SIGNAL PROCESSING SYSTEMS (SIPS)
Förläggare: IEEE
Moderpublikationens namn: Signal Processing Systems (SiPS), 2011 IEEE Workshop on
Tidskriftsakronym: IEEE WRK SIG PRO SYS
Artikelns första sida, sidnummer: 37
Artikelns sista sida, sidnummer: 42
Antal sidor: 6
ISBN: 978-1-4577-1920-2
ISSN: 1520-6130


Abstrakt

The scheduling at compile-time of dynamic dataflow programs is still an open problem. This paper presents some initial results showing that scheduling of dynamic portions of CAL dataflow networks can be reduced to static scheduling by the analysis of the state space of network partitions. The CAL sub-network is converted to an equivalent Promela program and analyzed using a state analysis tool (SPIN) identifying deterministic schedules that link recurring network execution states. Therefore, the only dynamic operation of the scheduler remains the guard evaluations between states linked by the obtained deterministic schedules. Experiments show that the number of 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-09-12 vid 02:53