Fast symbolic computation of the worst-case delay in tandem networks and applications - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Performance Evaluation Année : 2015

Fast symbolic computation of the worst-case delay in tandem networks and applications

Résumé

Computing deterministic performance guarantees is a defining issue for systems with hard real-time constraints , like reactive embedded systems. In this paper, we use burst-rate constrained arrivals and rate-latency servers to deduce tight worst-case delay bounds in tandem networks under arbitrary multiplexing. We present a constructive method for computing the exact worst-case delay, which we prove to be a linear function of the burstiness and latencies; our bounds are hence symbolic in these parameters. Our algorithm runs in quadratic time in the number of servers. We also present an application of our algorithm to the case of stochastic arrivals and server capacities. For a generalization of the exponentially bounded burstiness (EBB) model, we deduce a polynomial-time algorithm for stochastic delay bounds that strictly improve the state-of-the-art separated flow analysis (SFA) type bounds.
Fichier principal
Vignette du fichier
paper.pdf (396.24 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01231495 , version 1 (20-11-2015)

Identifiants

Citer

Anne Bouillard, Thomas Nowak. Fast symbolic computation of the worst-case delay in tandem networks and applications. Performance Evaluation, 2015, 91, pp.270-285. ⟨10.1016/j.peva.2015.06.016⟩. ⟨hal-01231495⟩
122 Consultations
162 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More