Relaxed Subgraph Execution Model for the Throughput Evaluation of IBSDF Graphs

Abstract : The Interface-Based Synchronous Dataflow (IBSDF) Model of Computation (MoC) is a hierarchical extension of the well-known Synchronous Dataflow (SDF) MoC. The IBSDF model extends the semantics of the SDF model by introducing a graph composition mechanism based on hierarchical interfaces. The IBSDF model introduces also execution rules to ease the analysis of the IBSDF graph such as evaluating the throughput; an essential key performance to evaluate when designing Digital Signal Processing (DSP) systems. However, respecting the execution rules may slow down the execution of IBSDF graphs, and so stop the applications to reach their maximum throughput. This article presents first how to speed-up the execution of an IBSDF graph by relaxing the execution rules. Second, a new method to compute the throughput of IBSDF graphs under a relaxed execution. Finally, a performance comparison between the proposed method and basic methods that rely on a transformation of the IBSDF graph to an equivalent non-hierarchical graph of potentially exponential size. The proposed method outperforms basic methods and makes it possible to evaluate the maximum throughput of large IBSDF graphs in less than 2 seconds.
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download
Contributor : Hamza Deroui <>
Submitted on : Thursday, July 27, 2017 - 10:20:25 AM
Last modification on : Thursday, March 21, 2019 - 2:34:13 PM


Files produced by the author(s)



Hamza Deroui, Karol Desnos, Jean-François Nezan, Alix Munier-Kordon. Relaxed Subgraph Execution Model for the Throughput Evaluation of IBSDF Graphs. International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation (SAMOS), Jul 2017, SAMOS, Greece. ⟨10.1109/SAMOS.2017.8344630⟩. ⟨hal-01569593⟩



Record views


Files downloads