You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

The Global Limited Preemptive Earliest Deadline First Feasibility of Sporadic Real-time Tasks

Fulltext:


Authors:

Abhilash Thekkilakattil, Sanjoy Baruah , Radu Dobrin, Sasikumar Punnekkat

Research group:

Dependable Software Engineering

Publication Type:

Conference/Workshop Paper

Venue:

The 26th Euromicro Conference on Real-Time Systems

Abstract

The feasibility of preemptive and non-preemptivescheduling has been well investigated on uniprocessor and multiprocessor platforms under both Fixed Priority Scheduling(FPS) and Earliest Deadline First (EDF) paradigms. While feasibility of limited preemptive scheduling under FPS has been addressed on both uniprocssor and multiprocessor platforms,under EDF it has been investigated only on uniprocessors, and a similar analysis for multiprocessor platforms is still missing.In this paper, we introduce global Limited Preemptive Earliest Deadline First (g-LP-EDF) scheduling, and propose the associated feasibility analysis to complete the above described feasibility analysis spectrum. Specifically, we derive a sufficient condition that guarantees g-LP-EDF feasibility of sporadic real timetasks which directly provides a global Non-Preemptive Earliest Deadline First (g-NP-EDF) feasibility test. We then study the interplay between g-LP-EDF feasibility and processor speed, in order to quantify the sub-optimality of g-NP-EDF in terms of the minimum speed-up required to guarantee g-NP-EDF feasibility of all feasible tasksets. The results presented in this paper complement our previous results on uniprocessors, and provide a unified result on the sub-optimality of non-preemptive EDF on both uniprocessor and multiprocessor platforms.

Bibtex

@inproceedings{Thekkilakattil3521,
author = {Abhilash Thekkilakattil and Sanjoy Baruah and Radu Dobrin and Sasikumar Punnekkat},
title = {The Global Limited Preemptive Earliest Deadline First Feasibility of Sporadic Real-time Tasks},
month = {July},
year = {2014},
booktitle = {The 26th Euromicro Conference on Real-Time Systems},
url = {http://www.es.mdu.se/publications/3521-}
}