SCHEDULING OF DYNAMIC DATAFLOW PROGRAMS BASED ON STATE SPACE ANALYSIS

Johan Ersfolk, G Roquier, Johan Lilius, M Mattavelli

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

    Abstract

    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.
    Original languageUndefined/Unknown
    Title of host publication2012 IEEE International Conference on Acoustics, Speech and Signal Processing
    PublisherIEEE
    Pages1661–1664
    Number of pages4
    ISBN (Print)978-1-4673-0045-2
    DOIs
    Publication statusPublished - 2012
    MoE publication typeA4 Article in a conference publication
    EventIEEE International Conference on Acoustics, Speech and Signal Processing - IEEE International Conference on Acoustics, Speech and Signal Processing
    Duration: 25 Mar 201230 Mar 2012

    Conference

    ConferenceIEEE International Conference on Acoustics, Speech and Signal Processing
    Period25/03/1230/03/12

    Keywords

    • Dataflow programming
    • MPEG-4 decoder
    • model checking

    Cite this