SCHEDULING OF DYNAMIC DATAFLOW PROGRAMS BASED ON STATE SPACE ANALYSIS

Johan Ersfolk, G Roquier, Johan Lilius, M Mattavelli

    Forskningsoutput: Kapitel i bok/konferenshandlingKonferensbidragVetenskapligPeer review

    18 Citeringar (Scopus)

    Sammanfattning

    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.
    OriginalspråkOdefinierat/okänt
    Titel på gästpublikation2012 IEEE International Conference on Acoustics, Speech and Signal Processing
    FörlagIEEE
    Sidor1661–1664
    Antal sidor4
    ISBN (tryckt)978-1-4673-0045-2
    DOI
    StatusPublicerad - 2012
    MoE-publikationstypA4 Artikel i en konferenspublikation
    EvenemangIEEE International Conference on Acoustics, Speech and Signal Processing - IEEE International Conference on Acoustics, Speech and Signal Processing
    Varaktighet: 25 mar 201230 mar 2012

    Konferens

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

    Nyckelord

    • Dataflow programming
    • MPEG-4 decoder
    • model checking

    Citera det här