Feasibility analysis of real-time transactions

  • Authors:
  • Ahmed Rahni;Emmanuel Grolleau;Michaël Richard;Pascal Richard

  • Affiliations:
  • AKKA Technologies, Nantes, France;LIAS, ENSMA-Université de Poitiers, Futuroscope Chasseneuil Cedex, France 86961;LIAS, ENSMA-Université de Poitiers, Futuroscope Chasseneuil Cedex, France 86961;LIAS, ENSMA-Université de Poitiers, Futuroscope Chasseneuil Cedex, France 86961

  • Venue:
  • Real-Time Systems
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

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.