K-Periodic schedules for evaluating the maximum throughput of a Synchronous Dataflow graph

Bruno Bodin, Alix Munier Kordon, BenoƮt Dupont de Dinechin. K-Periodic schedules for evaluating the maximum throughput of a Synchronous Dataflow graph. In 2012 International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation, SAMOS XII, Samos, Greece, July 16-19, 2012. pages 152-159, IEEE, 2012. [doi]

Abstract

Abstract is missing.