Show simple item record

dc.contributor.authorSkelin, Mladen
dc.contributor.authorGeilen, Marc
dc.contributor.authorCatthoor, Francky
dc.contributor.authorHendseth, Sverre
dc.identifier.citationMicroprocessors and microsystems. 2016, 1-22.nb_NO
dc.description.abstractDynamic dataflow models of computation (MoCs) have been introduced to provide designers with sufficient expressive power to capture increasing levels of dynamism in present-day streaming applications. Among dynamic dataflow MoCs, parameterized dataflow MoCs hold an important place. This is due to the fact that they allow for a compact representation of fine-grained data-dependent dynamics inherent to many present-day streaming applications. However, these models have been primarily analyzed for functional behavior and correctness, while the (parametric) analysis of their temporal behavior has attracted less attention. In this work, we (in a parametric fashion) analyze worst-case performance metrics (throughput and latency) of an important class of parameterized dataflow MoCs based on synchronous dataflow (SDF). We refer to such models as SDF-based parameterized dataflow (SDF-PDF). We show that parametric analysis in many cases allows to derive tighter conservative worst-case throughput and latency guarantees than the existing (nonparametric) techniques that rely on the creation of “worst-case SDF abstractions” of original parameterized specifications. Furthermore, we discuss how by using parametric analysis we can help address the scalability issues of enumerative analysis techniques. To achieve this, we first introduce the Max-plus algebraic semantics of SDF-PDF. Thereafter, we model run-time adaptation of parameters using the theory of Max-plus automata. Finally, we show how to derive the worst-case performance metrics from the resulting Max-plus automaton structure. We evaluate our approach on a representative case study from the multimedia domain.nb_NO
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internasjonal*
dc.titleWorst-case performance analysis of SDF-based parameterized dataflownb_NO
dc.typeJournal articlenb_NO
dc.typePeer reviewednb_NO
dc.source.journalMicroprocessors and microsystemsnb_NO
dc.description.localcode© 2016 Elsevier B.V. All rights reserved. This is the authors' accepted and refereed manuscript to the article. Locked until 12 December 2018 due to copyright restrictionsnb_NO
cristin.unitnameInstitutt for teknisk kybernetikk

Files in this item


This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivatives 4.0 Internasjonal
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 Internasjonal