Home > Publications
Home University of Twente
Prospective Students
Intranet (internal)

EEMCS EPrints Service

26979 Incremental analysis of cyclo-static synchronous dataflow graphs
Home Policy Brochure Browse Search User Area Contact Help

de Groote, E. and Hölzenspies, P.K.F. and Kuper, J. and Smit, G.J.M. (2015) Incremental analysis of cyclo-static synchronous dataflow graphs. ACM transactions on embedded computing systems, 14 (4). 68. ISSN 1539-9087 *** ISI Impact 0,714 ***

Full text available as:

- Univ. of Twente only
549 Kb

Official URL:

Exported to Metis


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.

Item Type:Article
Research Group:EWI-CAES: Computer Architecture for Embedded Systems
Research Program:CTIT-General
Research Project:POLCA: Programming Large Scale Heterogeneous Infrastructures, SENSATION: Self Energy-supporting Autonomous Computation
ID Code:26979
Deposited On:22 April 2016
ISI Impact Factor:0,714
More Information:statisticsmetis

Export this item as:

To request a copy of the PDF please email us request copy

To correct this item please ask your editor

Repository Staff Only: edit this item