Premium
End‐to‐end response time with fixed priority scheduling: trajectory approach versus holistic approach
Author(s) -
Martin Steven,
Minet Pascale,
George Laurent
Publication year - 2005
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.688
Subject(s) - computer science , scheduling (production processes) , end to end principle , quality of service , upper and lower bounds , trajectory , response time , mathematical optimization , real time computing , distributed computing , operations research , computer network , mathematics , mathematical analysis , physics , computer graphics (images) , astronomy
In this paper, we are interested in providing deterministic end‐to‐end guarantees to real‐time flows in a distributed system. We focus on the end‐to‐end response time, quality of service (QoS) parameter of the utmost importance for such flows. We assume that each node uses a Fixed Priority scheduling. We determine a bound on the end‐to‐end response time of any real‐time flow with a worst case analysis using the trajectory approach. We establish new results that we compare with those provided by the classical holistic approach for flows visiting the same sequence of nodes. These results show that the trajectory approach is less pessimistic than the holistic one. Moreover, the bound provided by our worst‐case analysis is reached in various configurations, as shown in the examples presented. Copyright © 2004 John Wiley & Sons, Ltd.