A Linear-Time Optimal Acceptance Test for Scheduling of Hard Real-Time Tasks

This paper describes an optimal acceptance test for scheduling sporadic requests together with periodic tasks on an earliest-deadline-rst basis. The deadlines of periodic requests must be met. Sporadic requests are accepted only if their deadlines can also be met. The time complexity of our acceptance test is O(n + m), where n is the number of periodic tasks and m is the number of sporadic requests that have previously been accepted but not completed. The proposed algorithm is a signiicant improvement over previous algorithms which are pseudo-polynomial in time complexity, i.e., O(N + m) where N is the number of periodic requests in a hyperperiod.