A Flexible Scheduling Algorithm for Real-Time Tasks with Resource Constraints

摘要

In this paper, we present an on-line scheduler dedicated to hard real-time environments. The application software is composed of periodic tasks and both soft and hard aperiodic tasks. The periodic tasks exclusively access to critical sections that are handled by the Dynamic Priority Ceiling Protocol. The main characteristic of the proposed scheduling algorithm, namely the EDL Server, is that it guarantees all deadliens of the periodic tasks, allocates as much time as possible to the soft aperiodic tasks and accepts hard aperiodic tasks as many as possible.