Print Email Facebook Twitter Efficient Computation of the Max-Plus Semantics of Synchronous Dataflow Graphs Title Efficient Computation of the Max-Plus Semantics of Synchronous Dataflow Graphs Author Elahi, H. Geilen, M. Basten, T. Publication year 2023 Abstract Streaming systems are naturally modeled with synchronous dataflow graphs (SDFGs). The max-plus semantics of an SDFG is a compact matrix representation of its timing behavior. The max-plus semantics enables us to analyze and control timing properties of the systems, such as the obtainable minimum guaranteed throughput and maximum latency. Deriving the max-plus semantics, and consequently, performance analysis may be computationally expensive since the state-of-the-art method simulates one iteration of an SDFG. This holds, in particular, for systems whose components operate at different levels of granularity, as this results in many executions of some components in one iteration. This paper aims at efficiently calculating the max-plus semantics of SDFGs. The paper proposes an optimization framework exploring decompositions of a given SDFG and finding a composition sequence whose computational effort for compositionally obtaining the max-plus semantics is minimal. Not only does our proposed technique accelerate the performance analysis of multiscale streaming systems, but it also allows us to compute the max-plus semantics of some systems for which the state-of-the-art method does not succeed because of memory limitations. Subject SemanticsComputational modelingTransform codingStreaming mediaDecodingOptimizationThroughput To reference this document use: http://resolver.tudelft.nl/uuid:5d763d85-b626-4cdb-9f83-d1c5e5f9993d DOI https://doi.org/10.1109/tcad.2023.3239538 TNO identifier 983162 Publisher IEEE ISSN 1937-4151 Source IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems Document type article Files To receive the publication files, please send an e-mail request to TNO Library.