A Polynomial Algorithm for the Computation of Buffer Capacities with Throughput Constraint for Embedded System Design - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

A Polynomial Algorithm for the Computation of Buffer Capacities with Throughput Constraint for Embedded System Design

Résumé

Marked Timed Weighted Event Graphs (in short MTWEG), which are a sub-class of Petri nets, are widely used for modelling practical industrial problems. In this paper, a central practical problem for the design of streaming (e.g. multimedia or network packet processing) applications is modelled using a MTWEG. The optimization problem tackled here consists then on finding an initial marking minimizing the overall number of tokens for a minimum given throughput. If the firings of the transitions are periodic, this problem is NP-complete and can be modelled using an Integer Linear Program. A general lower bound on the minimum overall capacity is then proved. If the initial MTWEG has a unique circuit, a polynomial time algorithm based on the resolution of a particular Diophantine equation is presented to solve it exactly. We lastly experiment it on an industrial example.
Fichier principal
Vignette du fichier
BMMKU.pdf (133.21 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-00368683 , version 1 (17-03-2009)

Identifiants

Citer

Mohamed Benazouz, Olivier Marchetti, Alix Munier-Kordon, Pascal Urard. A Polynomial Algorithm for the Computation of Buffer Capacities with Throughput Constraint for Embedded System Design. CIE IEEE International Conference on Computers & Industrial Engineering, Jul 2009, Troyes, France. pp.690-695, ⟨10.1109/ICCIE.2009.5223822⟩. ⟨hal-00368683⟩
133 Consultations
190 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More