Abstract
In the general context of tasks with offsets (general transactions), only exponential methods are known to calculate the exact worst-case response time (WCRT) of a task. The known pseudo-polynomial techniques give an upper bound of the WCRT. In this paper, we present a new worst-case response-time analysis technique (mixed method) for transactions scheduled by fixed priorities, and executing on a uniprocessor system. This new analysis technique gives a better (i.e. lower) pseudo-polynomial upper bound of the WCRT. The main idea is to combine the principle of exact calculation and the principle of approximation calculation, in order to decrease the pessimism of WCRT analysis, thus allowing improving the upper bound of the response time provided while preserving a pseudo-polynomial complexity. Then we define the Accumulative Monotonic property on which a necessary condition of feasibility is discussed. We also propose, to speed up the exact and mixed analysis, the dominated candidate task concept that allows reducing significantly the number of critical instants to study in an analysis.
Similar content being viewed by others
References
Audsley N, Burns A, Davis R, Tindell K, Wellings A (1995) Fixed priority preemptive scheduling: an historical perspective. Real-Time Syst 8: 129–154
Baruah S, Chen D, Gorinsky S, Mok A (1999) Generalized multiframe tasks. Int J Time-Crit Comput Syst 17: 5–22
Bini E, Buttazzo G (2004) Biasing effects in schedulablity measures. In: IEEE Proceedings of the 16th Euromicro conference on real-time systems (ECRTS04) Catania, Italy, p 16, July 2004
Han CC, Yan HY (1997) A better polynomial-time scedulability test for real-time fixed-priority scheduling algorithms. In: Proceedings of IEEE real-time systems symposium, pp 36–45, December 1997
Liu CL, Layland JW (1973) Scheduling algorithms for multiprogramming in real-time environnement. J ACM 20(1): 46–61
Maki-Turja J, Nolin M (2004) Faster response time analysis of tasks with offsets. In: Proceedings of 10th IEEE real-time technology and applications symposium (RTAS), May 2004
Maki-Turja J, Nolin M (2004) Tighter response time analysis of tasks with offsets. In: Proceedings of 10th international conference on real-time computing and applications (RTCSA’04), August 2004
Maki-Turja J, Nolin M (2005) Fast and tight response-times for tasks with offsets. In: 17th EUROMICRO conference on real-time systems IEEE Palma de Mallorca, Spain, July 2005
Maki-Turja J, Nolin M (2008) Efficient implementation of tight response-times for tasks with offsets. In: Real-time systems journal, February 2008. Springer, Netherlands
Mok AK, Chen D (1996) A multiframe model for real-time tasks. In: Proceeding of the 17th real-time systems symposium, Washington, pp 22–29, December 1996
Palencia JC, Gonzalez Harbour M (1998) Schedulability analysis for tasks with static and dynamic offsets. In: Proceedings of IEEE real-time system symposium (RTSS), p 19, December 1998
Palencia JC, Gonzalez Harbour M (2003) Offset-based response time analysis of distributed systems scheduled under EDF. In: Euromicro conference on real-time systems. Porto, Portugal, June 2003
Rahni A, Grolleau E, Richard M (2007) New worst-case response time analysis technique for real-time transactions. In: ISoLa workshop on leveraging applications of formal methods, verification and validation Isola2007 Poitiers France, vol RNTI-SM-1, pp 9–20, December 2007
Rahni A, Grolleau E, Richard M (2007) Méthode d’évaluation du pire temps de réponse de tâches à offset, 5 ème Ecole d’été temps réel ETR2007 Nantes France, Septembre 2007
Rahni A, Richard M, Grolleau E (2007) Nouvelle Approche Approximative D’Analyse de Temps de Réponse, Rapport interne 2007-001 LISI/ENSMA, Université de Poitiers
Rahni A, Traore K, Grolleau E, Richard M (2007) Comparaison of two worst-case response time analysis methods for real-time transactions. In: Junior researchers workshop on real-time computing, Nancy France, March 2007
Sha L, Rajkumar R, Lehoczky JP (1990) Piority inheritance protocols: an approach to real-time synchronization. IEEE Trans Comput 9(39): 1175–1185
Tindell K (1992) Using offset information to analyse static priority pre-emptively scheduled task sets. Technical Report YCD-182, Dept of Computer Science, Unoversity of York, England
Tindell K (1994) Adding time-offsets to schedulability analysis. Technical Report YCS 221, Dept of Computer Science, University of York, England, January 1994
Traore K, Grolleau E, Cottet F (2006) Characterization and analysis of tasks with offsets: monotonic transactions. In: Proceedings of 12th international conference on embedded and real-time computing systems and applications. RTCSA’06 Sydney, Australia, p 12
Traore K, Grolleau E, Cottet F (2006) Shedulability analysis of serial transactions. In: Real-time and network systems RTNS’06 Poitiers France, pp 141–149, May 2006
Traore K, Grolleau E, Cottet F (2006) Simpler of serial transactions using reverse transaction. In: ICAS 06
Traore K, Grolleau E, Rahni A, Richard M (2006) Response-time analysis of tasks with offsets. In: 12th IEEE international conference on emerging technologies and factory automation ETFA’06, September 2006
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Rahni, A., Grolleau, E. & Richard, M. An efficient response-time analysis for real-time transactions with fixed priority assignment. Innovations Syst Softw Eng 5, 197–209 (2009). https://doi.org/10.1007/s11334-009-0095-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11334-009-0095-2