A New Method for Minimizing Buffer Sizes for Cyclo-Static Dataflow Graphs.

Mohamed Benazouz (1) , Olivier Marchetti (1) , Alix Munier-Kordon (1) , Thierry Michel (2)

1 ALSOC - Architecture et Logiciels pour Systèmes Embarqués sur Puce
2 ST-CROLLES - STMicroelectronics [Crolles]

Several optimizations must be considered for the design of streaming applications (e.g. multimedia or network packet processing). These applications can be modelled as a set of processes that communicate using buffers. Cyclo-Static Dataflow graphs, which are an extension of Synchronous Dataflow graphs, allow to consider a large class of industrial applications. This paper presents an original methodology to minimize the global surface of the buffers for a Cyclo-Static Dataflow graph under a given throughput constraint. It is proved that, if the processes are periodic, each buffer introduces a linear constraint described analytically. The optimization problem is then modelled by an Integer Linear Program. A polynomial algorithm based on its relaxation provides a quasi-optimal solution for real life problems. The resolution of the optimization problem for a Reed-Solomon Decoder application is then detailed.

Mots clés: Buffer minimization; Streaming applications; Linear Programing; Periodic schedule; Streaming applications.; Cyclo-Static Dataflow graph

Domaines: Recherche opérationnelle [math.OC]

Mohamed Benazouz, Olivier Marchetti, Alix Munier-Kordon, Thierry Michel. A New Method for Minimizing Buffer Sizes for Cyclo-Static Dataflow Graphs.. ESTIMedia 2010 - 8th IEEE International Workshop on Embedded Systems for Real-Time Multimedia, Oct 2010, Scottsdale, Arizona, United States. pp.11-20, ⟨10.1109/ESTMED.2010.5666980⟩. ⟨hal-00461647⟩