Improved feasibility of fixed-priority scheduling with deferred preemptions using preemption thresholds for preemption points

R.J. Bril, M.M.H.P. Heuvel, van den, J.J. Lukkien

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

6 Citations (Scopus)
2 Downloads (Pure)

Abstract

This paper aims at advancing the relative strength of limited-preemptive schedulers by improving the feasibility of a task set and simultaneously limiting, or even precluding, arbitrary preemptions. In particular, we present a refinement of existing limited-preemptive fixed-priority scheduling (FPS) schemes with preemption thresholds for preemption points next to preemption thresholds for sub-jobs, termed fixed-priority scheduling with varying preemption thresholds (FPVS). We derive exact schedulability analysis for FPVS and we develop algorithms to maximize the schedulability of a set of sporadic tasks for given priorities. Since FPVS generalizes existing FPS schemes, we apply our algorithms to those schemes to compare the ratio of schedulable systems. Our experiments show that FPVS can achieve the same schedulability ratio with limited-preemptive sub-jobs as with entirely non-preemptive sub-jobs.
Original languageEnglish
Title of host publication21st International Conference on Real-Time Networks and Systems (RTNS, Sophia Antipolis, France, October 16-18, 2013)
Place of PublicationNew York NY
PublisherAssociation for Computing Machinery, Inc
Pages255-264
ISBN (Print)978-1-4503-2058-0
DOIs
Publication statusPublished - 2013
Event21st International Conference on Real-Time Networks and Systems, RTNS 2013 - Sophia Antipolis, France
Duration: 16 Oct 201318 Oct 2013
Conference number: 21
http://leat.unice.fr/RTNS2013/#page=home

Publication series

NameACM International Conference Proceeding Series

Conference

Conference21st International Conference on Real-Time Networks and Systems, RTNS 2013
Abbreviated titleRTNS 2013
Country/TerritoryFrance
CitySophia Antipolis
Period16/10/1318/10/13
Internet address

Fingerprint

Dive into the research topics of 'Improved feasibility of fixed-priority scheduling with deferred preemptions using preemption thresholds for preemption points'. Together they form a unique fingerprint.

Cite this