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

Authors:
Raymond Devillers;Joël Goossens
Affiliations:
(Correspd.) Département d'Informatique, Université Libre de Bruxelles, Brussels, Belgium. rdevil@ulb.ac.be;(Correspd.) Département d'Informatique, Université Libre de Bruxelles, Brussels, Belgium. Joel.Goossens@ulb.ac.be
Venue:
Fundamenta Informaticae
Year:
1999

Citing 5
Cited 0

An extendible approach for analyzing fixed priority hard real-time tasks

Real-Time Systems
The Non-Optimality of the Monotonic Priority Assignmentsfor Hard Real-Time Offset Free Systems

Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Feasibility Intervals for the Deadline Driven Scheduler with Arbitrary Deadlines

RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Scheduling of time critical processes

AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference

Quantified Score

Hi-index	0.00

Visualization

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.