Preemption points placement for sporadic task sets

Marko Bertogna, Giorgio Buttazzo, Mauro Marinoni, Gang Yao, Francesco Esposito, Marco Caccamo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Limited preemption scheduling has been introduced as a viable alternative to non-preemptive and fully-preemptive scheduling when reduced blocking times need to coexist with an acceptable context switch overhead. To achieve this goal, preemptions are allowed only at selected points of the code of each task, decreasing the preemption overhead and simplifying the estimation of worst-case execution parameters. Unfortunately, the problem of how to place these preemption points is rather complex and has not been solved. In this paper, a method is presented for the optimal placement of preemption points under simplifying conditions, namely, a fixed preemption overhead at each point. We will prove that if our method is not able to produce a feasible schedule, then no other possible preemption point placement (including non-preemptive and fully preemptive scheduling) can find a schedulable solution. The presented method is general enough to be applicable to both EDF and Fixed Priority scheduling, with limited modifications.

Original languageEnglish (US)
Title of host publicationProceedings - 22nd Euromicro Conference on Real-Time Systems, ECRTS 2010
Pages251-260
Number of pages10
DOIs
StatePublished - Oct 29 2010
Event22nd Euromicro Conference on Real-Time Systems, ECRTS 2010 - Brussels, Belgium
Duration: Jul 6 2010Jul 9 2010

Publication series

NameProceedings - Euromicro Conference on Real-Time Systems
ISSN (Print)1068-3070

Other

Other22nd Euromicro Conference on Real-Time Systems, ECRTS 2010
Country/TerritoryBelgium
CityBrussels
Period7/6/107/9/10

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture

Fingerprint

Dive into the research topics of 'Preemption points placement for sporadic task sets'. Together they form a unique fingerprint.

Cite this