Affiliations: Département d'Informatique, Université Libre de Bruxelles, Brussels, Belgium. [email protected] | Département d'Informatique, Université Libre de Bruxelles, Brussels, Belgium. [email protected]
Note: [] Address for correspondence: Département d'Informatique, CP212 , Université Libre de Bruxelles, Boulevard du Triomphe, B-1050 Brussels, Belgium
Note: [] Address for correspondence: Département d'Informatique, CP212 , Université Libre de Bruxelles, Boulevard du Triomphe, B-1050 Brussels, Belgium
Abstract: In this paper we study the problem of scheduling hard real-time periodic task sets with a dynamic and preemptive scheduler. We will focus on the response time notion, its interest and its effective computation for the deadline driven scheduler. We present a general calculation procedure for determining the response time of the kth request of a task in asynchronous systems with general as well as arbitrary deadlines. Finally, we analyze the performance of the computation so defined, both in terms of time and memory requirements.
Keywords: hard real-time scheduling, periodic task set, synchronous systems, asynchronous systems, deadline driven scheduler, response time
