K-Periodic schedules for evaluating the maximum throughput of a Synchronous Dataflow graph - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

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

Résumé

Synchronous Dataflow graphs, introduced by Lee and Messerschmitt in 1987, are a well-known formalism commonly used to model data-exchanges between parallel processes. This model was extensively studied in the last two decades because of the importance of its applications. However, the determination of a maximal throughput is a difficult question, for which no polynomial time algorithm exists to date. In this context, several authors proved that a K-Periodic schedule, where K is a vector of no polynomially bounded values, reaches the maximum throughput. On the other hand, a 1-Periodic schedule may be built polynomially, but without any guarantee on the throughput achieved. Therefore, the investigated problem is the trade-off between the schedule size induced by the vector K (called the periodicity vector) and its corresponding throughput. Necessary and sufficient conditions for the existence of K-Periodic schedules are first shown for any fixed value in the vector K; the computation of the maximum throughput of a K-Periodic schedule is deduced. A set of dominant values of K is exhibited, and a relationship between the optimal throughput of these values is proved. Some real-life experiments measure the variation of the throughput according to K.
Fichier non déposé

Dates et versions

hal-00880624 , version 1 (06-11-2013)

Identifiants

Citer

Bruno Bodin, Alix Munier-Kordon, Benoît Dupont de Dinechin. K-Periodic schedules for evaluating the maximum throughput of a Synchronous Dataflow graph. 2012 International Conference on Embedded Computer Systems (SAMOS), Jul 2012, Samos, Greece. pp.152 - 159, ⟨10.1109/SAMOS.2012.6404169⟩. ⟨hal-00880624⟩
94 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More