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.
Domains
Embedded Systems
Origin : Files produced by the author(s)
Loading...