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 Fixed Priority Scheduling

Authors:

Radu Dobrin, Gerhard Fohler

Publication Type:

Conference/Workshop Paper

Venue:

16th Euromicro Conference on Real-time Systems (ECRTS 04)

Abstract

Fixed priority scheduling (FPS) has been widely studied and used in a number of applications, mostly due to its flexibility, simple run-time mechanism and small overhead. However, preemption related overhead in FPS may cause undesired high processor utilization, high energy consumption, or, in some cases, even infeasibility.In this paper, we propose a method to reduce the number of preemptions in legacy FPS systems consisting of tasks with priorities, periods and offsets. Unlike other approaches, our algorithm does not require modification of the basic FPS mechanism. Our method analyzes off-line a set of periodic tasks scheduled by FPS, detects the maximum number of preemptions that can occur at run-time, and reassigns task attributes such that the tasks are schedulable by the same scheduling mechanism, while achieving a significantly lower number of preemptions.In some cases, there is a cost to pay for a lower number of preemptions in terms of increased amount of tasks and/or reduced task execution flexibility. Our method provides for the ability to choose a user-defined number of preemptions with respect to the cost to pay.

Bibtex

@inproceedings{Dobrin565,
author = {Radu Dobrin and Gerhard Fohler},
title = {Reducing the Number of Preemptions in Fixed Priority Scheduling},
month = {July},
year = {2004},
booktitle = {16th Euromicro Conference on Real-time Systems (ECRTS 04)},
url = {http://www.es.mdu.se/publications/565-}
}