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
Quantifying the Sub-optimality of Non-preemptive Real-time Scheduling
Publication Type:
Conference/Workshop Paper
Venue:
The 25th Euromicro Conference on Real-Time Systems
Abstract
A number of preemptive real-time scheduling
algorithms, such as the Earliest Deadline First (EDF), are
known to be optimal on uni-processor systems under specified
assumptions. However, no uni-processor optimal algorithm
exists under the non-preemptive scheduling paradigm. Hence
preemptive schemes strictly dominate non-preemptive schemes
with respect to uni-processor feasibility. However, the ’goodness’
of non-preemptive schemes, compared to uni-processor
optimal preemptive scheduling schemes such as the EDF, which
can also be referred to as its sub-optimality, has not been fully
investigated yet. In this paper, we apply resource augmentation,
specifically processor speed-up, to quantify the sub-optimality
of non-preemptive scheduling with respect to EDF, and apply
the results to guarantee user specified upper-bounds on the
preemption related costs in the schedule. In particular, we
derive an upper bound on the minimum processor speed-up
required to guarantee the non-preemptive feasibility of tasks
that are deemed feasible under the preemptive EDF, and we
prove that, in the cases where, for all tasks in the task set, the
largest execution requirement is not greater than the shortest
deadline, this bound is equal to 4. We also show how the
proposed approach enables a system designer to choose an
optimal processor in order to, e.g., guarantee specified upperbounds
on the preemption related overheads.
Bibtex
@inproceedings{Thekkilakattil2786,
author = {Abhilash Thekkilakattil and Radu Dobrin and Sasikumar Punnekkat},
title = {Quantifying the Sub-optimality of Non-preemptive Real-time Scheduling},
month = {July},
year = {2013},
booktitle = {The 25th Euromicro Conference on Real-Time Systems},
url = {http://www.es.mdu.se/publications/2786-}
}