Sciweavers

Share
JSA
2000

Schedulability analysis of periodic and aperiodic tasks with resource constraints

10 years 4 months ago
Schedulability analysis of periodic and aperiodic tasks with resource constraints
In this paper, we address the problem of scheduling hybrid task sets consisting of hard periodic and soft aperiodic tasks that may share resources in exclusive mode in a dynamic environment, where tasks are scheduled based on their deadlines. Bounded blocking on exclusive resources is achieved by means of a dynamic resource access protocol which also prevents deadlocks and chained blocking. Aperiodic responsiveness is enhanced by an efficient servicing technique which assigns each aperiodic request a suitable deadline. Feasibility conditions are extended to handle tasks with deadlines different than periods and a reclaiming technique is presented to deal with early completions.
Giuseppe Lipari, Giorgio C. Buttazzo
Added 19 Dec 2010
Updated 19 Dec 2010
Type Journal
Year 2000
Where JSA
Authors Giuseppe Lipari, Giorgio C. Buttazzo
Comments (0)
books