Scheduling of dynamic dataflow programs with model checking
Authors:
- 1 October 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21623562,p. 37-42
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
This publication has 12 references indexed in Scilit:
- Classification and transformation of dynamic dataflow programs2010
- The Reconfigurable Video Coding Standard [Standards in a NutshellIEEE Signal Processing Magazine, 2010
- Exploiting Statically Schedulable Regions in Dataflow ProgramsJournal of Signal Processing Systems, 2010
- An efficient technique for analysis of minimal buffer requirements of synchronous dataflow graphs with model checking2009
- Quasi-Static Scheduling of CAL Actor Networks for Reconfigurable Video CodingJournal of Signal Processing Systems, 2009
- Software Code Generation for the RVC-CAL LanguageJournal of Signal Processing Systems, 2009
- Static Scheduling and Software Synthesis for Dataflow Graphs with Symbolic Model-Checking2007
- Software and the Concurrency RevolutionQueue, 2005
- Minimising buffer requirements of synchronous dataflow graphs with model checking2005
- Counting interface automata and their application in static analysis of actor models2005