Towards best-case response times of real-time tasks under fixed-priority scheduling with deferred preemption

In this paper, we present lower bounds for best-case response times of periodic tasks under fixed-priority scheduling with deferred preemption (FPDS) and arbitrary phasing. Our analysis is based on a dedicated conjecture for a ?-optimal instant, and uses the notion of best-case occupied time. We briefly compare best-case analysis and worst-case analysis for FPDS and arbitrary phasing.

[1]  Chang-Gun Lee,et al.  Limited Preemptible Scheduling to Embrace Cache Memory in Real-Time Systems , 1998, LCTES.

[2]  Reinder J. Bril,et al.  Exact worst-case response times of real-time tasks under fixed-priority scheduling , 2004 .

[3]  Alan Burns,et al.  Restricted tasking models , 1997 .

[4]  J. H. Patel,et al.  Use of preferred preemption points in cache-based real-time systems , 1995, Proceedings of 1995 IEEE International Computer Performance and Dependability Symposium.

[5]  Ola Redell,et al.  Exact best-case response time analysis of fixed priority scheduled tasks , 2002, Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002.

[6]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[7]  John P. Lehoczky,et al.  Fixed priority scheduling of periodic task sets with arbitrary deadlines , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[8]  Reinder J. Bril,et al.  Best-Case Response Times and Jitter Analysis of Real-Time Tasks , 2004, J. Sched..

[9]  John P. Lehoczky,et al.  Algorithms for scheduling hard aperiodic tasks in fixed-priority systems using slack stealing , 1994, 1994 Proceedings Real-Time Systems Symposium.

[10]  Mark Klein,et al.  A practitioner's handbook for real-time analysis - guide to rate monotonic analysis for real-time systems , 1993, The Kluwer international series in engineering and computer science.

[11]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[12]  Guru M. Parulkar,et al.  Bringing real-time scheduling theory and practice closer for multimedia computing , 1996, SIGMETRICS '96.

[13]  Alan Burns,et al.  Preemptive priority-based scheduling: an appropriate engineering approach , 1995 .

[14]  Alan Burns,et al.  Hard Real-Time Scheduling: The Deadline-Monotonic Approach , 1991 .

[15]  Alan Burns.  Defining New Non-preemptive Dispatching and Locking Policies for Ada , 2001, Ada-Europe.