HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Feasibility Analysis of Non-Concrete Real-Time Transactions With EDF Assignment priority

Abstract : We present a density based feasibility analysis of tasks with offset (non-concrete transactions) scheduled by preemptive EDF, on a uniprocessor system. Our method extends the analysis technique proposed for sporadic tasks, in [4, 2], that allows a global schedulability analysis of a system. We will show that, for non-concrete transactions, the naive extension analysis is intractable due to an important number of busy periods to consider. To avoid this problem we propose a pseudo-polynomial analysis technique that gives a necessary and sufficient condition of schedulability. This technique is based on the demand bound function. Finally, We provide an efficient implementation, for the presented analysis method, that speeds up the algorithm.
Document type :
Conference papers
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download

Contributor : Anne Jaigu Connect in order to contact the contributor
Submitted on : Tuesday, November 4, 2008 - 12:51:02 PM
Last modification on : Wednesday, October 20, 2021 - 3:22:08 AM
Long-term archiving on: : Monday, June 7, 2010 - 10:43:26 PM


Files produced by the author(s)


  • HAL Id : inria-00336510, version 1



Ahmed Rahni, Emmanuel Grolleau, Michael Richard. Feasibility Analysis of Non-Concrete Real-Time Transactions With EDF Assignment priority. 16th International Conference on Real-Time and Network Systems (RTNS 2008), Isabelle Puaut, Oct 2008, Rennes, France. ⟨inria-00336510⟩



Record views


Files downloads