Incremental analysis of cyclo-static synchronous dataflow graphs

Robert de Groote, Philip K.F. Hölzenspies, Jan Kuper, Gerard J.M. Smit

    Research output: Contribution to journalArticleAcademicpeer-review

    2 Citations (Scopus)
    14 Downloads (Pure)


    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 languageEnglish
    Article number68
    Number of pages25
    JournalACM transactions on embedded computing systems
    Issue number4
    Publication statusPublished - 8 Dec 2015


    • 2024 OA procedure
    • EC Grant Agreement nr.: FP7/610686
    • EC Grant Agreement nr.: FP7-ICT-2013-10
    • EC Grant Agreement nr.: FP7-ICT-2011-8
    • EC Grant Agreement nr.: FP7/318490
    • Analysis
    • dataflow graphs
    • cyclo-static synchronous


    Dive into the research topics of 'Incremental analysis of cyclo-static synchronous dataflow graphs'. Together they form a unique fingerprint.

    Cite this