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

Abstract : 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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [27 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00368683
Contributor : Olivier Marchetti <>
Submitted on : Tuesday, March 17, 2009 - 11:42:50 AM
Last modification on : Thursday, March 21, 2019 - 1:20:37 PM
Document(s) archivé(s) le : Tuesday, June 8, 2010 - 11:33:12 PM

File

BMMKU.pdf
Publisher files allowed on an open archive

Identifiers

Citation

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⟩

Share

Metrics

Record views

226

Files downloads

131