Scheduling of dynamic dataflow programs with model checking

Johan Ersfolk, Ghislain Roquier, Fareed Jokhio, Johan Lilius, Marco Mattavelli

    Research output: Chapter in Book/Conference proceedingConference contributionScientificpeer-review

    15 Citations (Scopus)


    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.
    Original languageUndefined/Unknown
    Title of host publicationSignal Processing Systems (SiPS), 2011 IEEE Workshop on
    Number of pages6
    ISBN (Print)978-1-4577-1920-2
    Publication statusPublished - 2011
    MoE publication typeA4 Article in a conference publication
    EventIEEE Workshop on Signal Processing Systems (SiPS) - IEEE Workshop on Signal Processing Systems (SiPS), 2011
    Duration: 4 Oct 20117 Oct 2011


    ConferenceIEEE Workshop on Signal Processing Systems (SiPS)


    • Dataflow programming
    • MPEG-4 decoder
    • model checking

    Cite this