Skip to main content
SpringerLink
Log in

Feasibility analysis of real-time transactions

  • Published:
Real-Time Systems Aims and scope Submit manuscript

Abstract

The objective of this paper is two-fold: give a survey of response time analysis (RTA), and contribute to schedulability analysis for the real-time transaction model. The RTA is studied under fixed priority policies (FPP), while schedulability analysis assumes an optimal scheduling algorithm (like the deadline driven scheduling algorithm EDF) in a preemptive context on uniprocessor systems. We compare the transaction model to the family of multiframe models, then present the exact, and approximated methods, as well as a tunable method to compute the RTA. Finally we present a new schedulability analysis method and an efficient algorithm to speed up this test.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

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

    Article  Google Scholar 

  • Baruah S (1993) The uniprocessor scheduling of sporadic real-time tasks. Phd thesis, Department of Computer Science. The University of Texas at Austin

  • Baruah SK (2003) Dynamic- and static-priority scheduling of recurring real-time tasks. Real-Time Syst 24:93–128. doi:10.1023/A:1021711220939

    Article  MATH  Google Scholar 

  • Baruah S (2010) The non-cyclic recurring real-time task model. In: Real-time systems symposium, IEEE international, pp 173–182

    Chapter  Google Scholar 

  • Baruah S, Mok A, Rosier L (1990a) The preemptive scheduling of sporadic real-time tasks on one processor. In: Proceedings of the 11th real-time systems symposium, pp 182–190

    Chapter  Google Scholar 

  • Baruah S, Rosier L, Howell R (1990b) Algorithms and complexity concerning the preemptive scheduling of periodic real-time tasks on one processor. J Real-Time Syst 2

  • Baruah S, Chen D, Gorinsky S, Mok A (1999a) Generalized multiframe tasks. Int J Time-Critical Comput Syst 17:5–22

    Google Scholar 

  • Baruah SK, Chen D, Gorinsky S, Mok AK (1999b) Generalized multiframe tasks. Real-Time Syst 17(1):5–22

    Article  Google Scholar 

  • Bini E, Buttazzo GC (2004) Biasing effects in schedulability measures. In: ECRTS. IEEE Computer Society, Los Alamitos, pp 196–203

    Google Scholar 

  • Buttazzo G (1997) Hard real-time computing systems: predictable scheduling algorithms and applications. Kluwer Academic, Boston

    MATH  Google Scholar 

  • Eisenbrand F, RothvoßT (2008) Static-priority real-time scheduling: Response time computation is np-hard. In: Proc 29th real-time systems symposium, Barcelona, Spain, pp 397–406

    Google Scholar 

  • Eisenbrand F, RothvoßT (2010) Edf-schedulability of synchronous periodic task systems is conp-hard. In: Proc. ACM-SIAM symposium on discrete algorithms (SODA10), Austin, Texas, pp 1029–1034

    Google Scholar 

  • Gutierrez JP, Harbour MG (1998) Schedulability analysis for tasks with static and dynamic offsets. In: Proc IEEE real-time system symposium (RTSS)

    Google Scholar 

  • Gutierrez JP, Harbour MG (2003) Offset-based response time analysis of distributed systems scheduled under edf. In: Euromicro conference on real-time systems, Porto, Portugal

    Google Scholar 

  • Harbour MG, Gutierrez JP (2003) Response time analysis for tasks scheduled under EDF within fixed priorities. In: Real-time systems symposium, RTSS2003, pp 200–209

    Google Scholar 

  • Harbour MG, Klein MH, Obenza R, Pollak B, Ralya T (1993) A practitioner’s handbook for real-time analysis: guide to rate monotonic analysis for real-time systems. Kluwer Academic, Norwell

    Google Scholar 

  • Joseph M, Pandya P (1986) Finding response time in a real-time system. Comput J 29:390–395

    Article  MathSciNet  Google Scholar 

  • Lehoczky J (1990) Fixed priority scheduling of periodic tasks sets with arbitrary deadlines. In: Proceedings of real-time systems symposium, pp 166–171

    Google Scholar 

  • Liu C, Layland J (1973) Scheduling algorithms for multiprogramming in real-time environment. J ACM 1:46–61

    Article  MathSciNet  Google Scholar 

  • Mäki-Turja J, Nolin M (2004a) Faster response time analysis of tasks with offsets. In: Proc 10th IEEE real-time technology and applications symposium (RTAS)

    Google Scholar 

  • Mäki-Turja J, Nolin M (2004b) Tighter response time analysis of tasks with offsets. In: Proc 10th International conference on real-time computing and applications (RTCSA’04)

    Google Scholar 

  • Mäki-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

    Google Scholar 

  • Mäki-Turja J, Nolin M (2008) Efficient implementation of tight response-times for tasks with offsets. Real-Time Syst J

  • Mäki-Turja J, Hannien K, Nolin M (2005) Efficient development of real-time systems using hybrid scheduling. In: International conference on embedded systems and applications (ESA)

    Google Scholar 

  • Mok A, Chen D (1996) A multiframe model for real-time tasks. In: Proceedings of the 17th real-time systems symposium, Washington, pp 22–29

    Chapter  Google Scholar 

  • Mok A, Chen D (1997) A multiframe model for real-time tasks. In: IEEE Trans Softw Eng, pp 635–645

    Google Scholar 

  • Moyo NT, Nicollet E, Lafaye F, Moy C (2010) On schedulability analysis of non-cyclic generalized multiframe tasks. In: Euromicro conference on real-time systems, pp 271–278

    Chapter  Google Scholar 

  • Pellizzoni R (2004) Efficient feasibility analysis of real-time asynchronous task sets. Master’s thesis, Università di Pisa

  • Pellizzoni R, Lipari G (2005a) Improved schedulability analysis of real-time transactions with earliest deadline scheduling. In: Proceedings of the 11th IEEE real time and embedded technology and applications symposium (RTAS05), pp 66–75

    Chapter  Google Scholar 

  • Pellizzoni R, Lipari G (2005b) Feasibility analysis of real-time periodic tasks with offsets. Real-Time Syst 30(1–2):105–128

    Article  MATH  Google Scholar 

  • Pellizzoni R, Lipari G (2006) Improved schedulability analysis of real-time transactions with earliest deadline scheduling. J Comput Syst Sci

  • Pop T, Eles P, Peng Z (2003) Schedulability analysis for distributed heterogenous time/event triggered real time systems. In: Proceedings of the 15th Euromicro conference on real-time systems

    Google Scholar 

  • Rahni A (2008) Contributions à la validation d’ordonnancement temps réel en présence de transactions sous priorités fixes et EDF. Thèse, ENSMA-Université Poitiers

  • Rahni A, Grolleau E, Richard M (2007a) 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

    Google Scholar 

  • Rahni A, Traoré K, Grolleau E, Richard M (2007b) Comparison of two worst-case response time analysis methods for real-time transactions. In: Junior researchers workshop on real-time computing

    Google Scholar 

  • Rahni A, Grolleau E, Richard M (2007c) Méthode d’évaluation du pire temps de réponse de tâches à offset. 5 eme Ecole d’été temps réel ETR2007 Nantes France

  • Rahni A, Grolleau E, Richard M (2008) Feasibility analysis of non-concrete real-time transactions with EDF assignment priority. In: 16th international conference on real-time and network systems, Rennes, France

    Google Scholar 

  • Rahni A, Grolleau E, Richard M (2009) An efficient response time analysis for real-time transactions with fixed priority assignment. Inov Syst Softw Eng J 5(3):197–209

    Article  Google Scholar 

  • Sha L, Rajkumar R, Lehoczky J (1990) Priority inheritance protocols: an approach to real-time synchronization. IEEE Trans Comput 39(9):1175–1185

    Article  MathSciNet  Google Scholar 

  • Spuri M (1996) Analysis of deadline scheduled real-time systems. RR-2772, INRIA, France

  • Stigge M, Ekberg P, Guan N, Yi W (2011) The digraph real-time task model. In: Proc 17th real-time and embedded technology and applications symposium. IEEE, New York

    Google Scholar 

  • Takada H, Sakamura K (1997a) Schedulability of generalized multiframe task sets under static priority assignment. In: RTCSA. IEEE Computer Society, Los Alamitos, pp 80–86

    Google Scholar 

  • Takada H, Sakamura K (1997b) Schedulability of generalized multiframe task sets under static priority assignment. In: Proceedings—fourth international workshop on real-time computing systems and applications, pp 80–86

    Chapter  Google Scholar 

  • Tindell K (1992) Using offset information to analyze static priority pre-emptively scheduled task sets. Technical Report YCD-182,Dept of Computer Science, University of York, England

  • Tindell K (1994) Adding time-offsets to schedulability analysis. Technical Report YCS 221, Dept of Computer Science, University of York, England

  • Tindell K, Burns A, Wellings A (1992) An extensible approach for analyzing fixed priority hard real-time tasks. YCS 189 Department of Computer Science, University of York

  • Traoré K (2007) Analyse et validation des applications temps réel en présence de transactions : application au pilotage d’un drone miniature. Thèse, ENSMA-Université Poitiers

  • Traoré K, Grolleau E, Cottet F (2006a) Characterization and analysis of tasks with offsets: monotonic transactions. In: Proc 12th international conference on embedded and real-time computing systems and applications. RTCSA’06, Sydney, Australia

    Google Scholar 

  • Traore K, Grolleau E, Rahni A, Richard M (2006a) Response-time analysis of tasks with offsets. In: 12th IEEE international conference on emerging technologies and factory automation ETFA’06

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. AKKA Technologies, Nantes, France

    Ahmed Rahni

  2. LIAS, ENSMA-Université de Poitiers, Téléport 2, 1 Av. Clément Ader, BP 40109, 86961, Futuroscope Chasseneuil Cedex, France

    Emmanuel Grolleau, Michaël Richard & Pascal Richard

Authors
  1. Ahmed Rahni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Emmanuel Grolleau
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michaël Richard
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Pascal Richard
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Emmanuel Grolleau.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rahni, A., Grolleau, E., Richard, M. et al. Feasibility analysis of real-time transactions. Real-Time Syst 48, 320–358 (2012). https://doi.org/10.1007/s11241-012-9147-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11241-012-9147-z

Keywords

Search

Navigation