General Response Time Computation for the Deadline Driven Scheduling of Periodic Tasks

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 k^th 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.