By Topic

Dynamic acceptance of aperiodic tasks with periodic tasks under resource sharing constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
M. Silly-Chetto ; IRESTE, Nantes Univ., France

A real time system is considered in which a set of periodic tasks are scheduled on an earliest-deadline-first basis and exclusively access critical sections through a dynamic priority ceiling protocol. An optimal online acceptance test is described for hard deadline aperiodic tasks. Aperiodic tasks are accepted only if all deadlines can be met. Here, optimality means that the algorithm is able to answer `yes' to the question of the acceptance of a newly occurring task each time it is possible. The time complexity of the test is O([R/p].n+m) where n is the number of periodic tasks, R is the longest deadline, p is the shortest period and m is the number of aperiodic tasks that have previously been accepted but not completed

Published in:

IEE Proceedings - Software  (Volume:146 ,  Issue: 2 )