Title :
Scheduling of dynamic dataflow programs with model checking
Author :
Ersfolk, Johan ; Roquier, Ghislain ; Jokhio, Fareed ; Lilius, Johan ; Mattavelli, Marco
Abstract :
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.
Keywords :
data flow analysis; formal verification; scheduling; CAL dataflow networks; Promela program; compile time; dynamic dataflow program scheduling; model checking; state analysis tool; Availability; Decoding; Dynamic scheduling; Processor scheduling; Schedules; Switches; Transform coding; Dataflow programming; MPEG-4 decoder; model checking;
Conference_Titel :
Signal Processing Systems (SiPS), 2011 IEEE Workshop on
Conference_Location :
Beirut
Print_ISBN :
978-1-4577-1920-2
DOI :
10.1109/SiPS.2011.6088946