Incremental analysis of cyclo-static synchronous dataflow graphs

Robert de Groote, P.K.F. Holzenspies, Jan Kuper, Gerardus Johannes Maria Smit

    Research output: Contribution to journalArticleAcademicpeer-review

    2 Citations (Scopus)

    Abstract

    In this article, we present a mathematical characterisation of admissible schedules of cyclo-static dataflow (csdf) graphs. We demonstrate how algebra ic manipulation of this characterization is related to unfolding csdf actors and how this manipulation allows csdf graphs to be transformed into mrsdf graphs that are equivalent, in the sense that they admit the same set of schedules. The presented transformation allows the rich set of existing analysis techniques for mrsdf graphs to be applied to csdf graphs and generalizes the well-known transformations from csdf and mrsdf into hsdf. Moreover, it gives rise to an incremental approach to the analysis of csdf graphs, where approximate analyses are combined with exact transformations. We show the applicability of this incremental approach by demonstrating its effectiveness on the problem of optimizing buffer sizes under a throughput constraint.
    Original languageUndefined
    Pages (from-to)68
    Number of pages25
    JournalACM transactions on embedded computing systems
    Volume14
    Issue number4
    DOIs
    Publication statusPublished - Dec 2015

    Keywords

    • EC Grant Agreement nr.: FP7/318490
    • EC Grant Agreement nr.: FP7/610686
    • EWI-26979
    • IR-100312
    • EC Grant Agreement nr.: FP7-ICT-2013-10
    • METIS-316911
    • EC Grant Agreement nr.: FP7-ICT-2011-8

    Cite this

    @article{89df9f3763e64c7192cf23f04670619a,
    title = "Incremental analysis of cyclo-static synchronous dataflow graphs",
    abstract = "In this article, we present a mathematical characterisation of admissible schedules of cyclo-static dataflow (csdf) graphs. We demonstrate how algebra ic manipulation of this characterization is related to unfolding csdf actors and how this manipulation allows csdf graphs to be transformed into mrsdf graphs that are equivalent, in the sense that they admit the same set of schedules. The presented transformation allows the rich set of existing analysis techniques for mrsdf graphs to be applied to csdf graphs and generalizes the well-known transformations from csdf and mrsdf into hsdf. Moreover, it gives rise to an incremental approach to the analysis of csdf graphs, where approximate analyses are combined with exact transformations. We show the applicability of this incremental approach by demonstrating its effectiveness on the problem of optimizing buffer sizes under a throughput constraint.",
    keywords = "EC Grant Agreement nr.: FP7/318490, EC Grant Agreement nr.: FP7/610686, EWI-26979, IR-100312, EC Grant Agreement nr.: FP7-ICT-2013-10, METIS-316911, EC Grant Agreement nr.: FP7-ICT-2011-8",
    author = "{de Groote}, Robert and P.K.F. Holzenspies and Jan Kuper and Smit, {Gerardus Johannes Maria}",
    note = "eemcs-eprint-26979",
    year = "2015",
    month = "12",
    doi = "10.1145/2792981",
    language = "Undefined",
    volume = "14",
    pages = "68",
    journal = "ACM transactions on embedded computing systems",
    issn = "1539-9087",
    publisher = "Association for Computing Machinery (ACM)",
    number = "4",

    }

    Incremental analysis of cyclo-static synchronous dataflow graphs. / de Groote, Robert; Holzenspies, P.K.F.; Kuper, Jan; Smit, Gerardus Johannes Maria.

    In: ACM transactions on embedded computing systems, Vol. 14, No. 4, 12.2015, p. 68.

    Research output: Contribution to journalArticleAcademicpeer-review

    TY - JOUR

    T1 - Incremental analysis of cyclo-static synchronous dataflow graphs

    AU - de Groote, Robert

    AU - Holzenspies, P.K.F.

    AU - Kuper, Jan

    AU - Smit, Gerardus Johannes Maria

    N1 - eemcs-eprint-26979

    PY - 2015/12

    Y1 - 2015/12

    N2 - In this article, we present a mathematical characterisation of admissible schedules of cyclo-static dataflow (csdf) graphs. We demonstrate how algebra ic manipulation of this characterization is related to unfolding csdf actors and how this manipulation allows csdf graphs to be transformed into mrsdf graphs that are equivalent, in the sense that they admit the same set of schedules. The presented transformation allows the rich set of existing analysis techniques for mrsdf graphs to be applied to csdf graphs and generalizes the well-known transformations from csdf and mrsdf into hsdf. Moreover, it gives rise to an incremental approach to the analysis of csdf graphs, where approximate analyses are combined with exact transformations. We show the applicability of this incremental approach by demonstrating its effectiveness on the problem of optimizing buffer sizes under a throughput constraint.

    AB - In this article, we present a mathematical characterisation of admissible schedules of cyclo-static dataflow (csdf) graphs. We demonstrate how algebra ic manipulation of this characterization is related to unfolding csdf actors and how this manipulation allows csdf graphs to be transformed into mrsdf graphs that are equivalent, in the sense that they admit the same set of schedules. The presented transformation allows the rich set of existing analysis techniques for mrsdf graphs to be applied to csdf graphs and generalizes the well-known transformations from csdf and mrsdf into hsdf. Moreover, it gives rise to an incremental approach to the analysis of csdf graphs, where approximate analyses are combined with exact transformations. We show the applicability of this incremental approach by demonstrating its effectiveness on the problem of optimizing buffer sizes under a throughput constraint.

    KW - EC Grant Agreement nr.: FP7/318490

    KW - EC Grant Agreement nr.: FP7/610686

    KW - EWI-26979

    KW - IR-100312

    KW - EC Grant Agreement nr.: FP7-ICT-2013-10

    KW - METIS-316911

    KW - EC Grant Agreement nr.: FP7-ICT-2011-8

    U2 - 10.1145/2792981

    DO - 10.1145/2792981

    M3 - Article

    VL - 14

    SP - 68

    JO - ACM transactions on embedded computing systems

    JF - ACM transactions on embedded computing systems

    SN - 1539-9087

    IS - 4

    ER -