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

Reducing the Number of Preemptions in Standard Fixed Priority Scheduling

Authors:

Radu Dobrin, Gerhard Fohler

Publication Type:

Conference/Workshop Paper

Venue:

Proc. 14th Euromicro International Conference on Real-Time Systems, Work in Progress Session,

Abstract

Preemptive fixed priority scheduling (FPS) has been widely studied and used in a number of industrial applications, mostly due to its flexibility and simple run-time mechanism. However, preemption related overhead in preemptive FPS may cause undesired high processor utilization or, in some cases, even infeasibility.In this paper, we propose a method to reduce the number of preemptions in standard preemptive fixed priority scheduling. The method analyzes, assuming the worst case execution times (WCET), a set of periodic tasks scheduled by a preemptive fixed priority scheduling algorithm, detects the number of preemptions that may occur, and reassigns task attributes such that the tasks will execute at run-time achieving a lower number of preemptions, completing before the deadlines and without modifying the basic FPS mechanism.

Bibtex

@inproceedings{Dobrin338,
author = {Radu Dobrin and Gerhard Fohler},
title = {Reducing the Number of Preemptions in Standard Fixed Priority Scheduling},
month = {June},
year = {2002},
booktitle = {Proc. 14th Euromicro International Conference on Real-Time Systems, Work in Progress Session,},
url = {http://www.es.mdu.se/publications/338-}
}