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

Preemption Point Selection in Limited Preemptive Scheduling using Probabilistic Preemption Costs

Fulltext:


Publication Type:

Conference/Workshop Paper

Venue:

28th Euromicro Conference on Real-Time Systems


Abstract

Limited Preemptive Scheduling is an attractive paradigm that enables controlling preemption related overheads, by appropriate preemption point selection. The selection of preemption points is essential to ensure schedulability and the associated analysis accounts for upper bounded preemption overheads, thus introducing a potentially high level of pessimism in the results. In this paper we propose a probabilistic distribution model of preemption related overhead and an accompanying method for preemption point selection based on quantiles, which provides controllable probabilistic relaxations. An experimental evaluation demonstrates the improvement of the extent to which this new approach facilitates finding solutions to the preemption point selection problem.

Bibtex

@inproceedings{Markovic4414,
author = {Filip Markovic and Jan Carlson and Radu Dobrin},
title = {Preemption Point Selection in Limited Preemptive Scheduling using Probabilistic Preemption Costs},
month = {July},
year = {2016},
booktitle = {28th Euromicro Conference on Real-Time Systems},
url = {http://www.es.mdh.se/publications/4414-}
}