In this paper, we describe an optimal approach for jointly scheduling periodic critical tasks and sporadic tasks. The problem is to schedule the tasks so that all the hard deadlines of periodic tasks are met and the response times for sporadic tasks are minimized. We show how optimal responsiveness can be attained by exploiting specific properties of the Earliest Deadline scheduling algorithm, in particular, how every occurring soft sporadic task is changing to a critical one by the adequate computation of a fictive deadline. Finally, to illustrate the performance of our approach, we provide a comparative study with other approaches and we report on simulation results.
Dynamic Scheduling, Earliest Deadline, Periodic Critical Tasks, Real-time systems, Sporadic Tasks, Response Time.
All articles published by Studies in Informatics and Control (SIC) are published in accordance with the terms and conditions of the Creative Commons Attribution License (CC BY-NC-SA 4.0).