research-article

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

Authors:

Reinder J. Bril,

Martijn M. H. P. van den Heuvel,

Johan J. LukkienAuthors Info & Claims

RTNS '13: Proceedings of the 21st International conference on Real-Time Networks and Systems

Pages 255 - 264

https://doi.org/10.1145/2516821.2516824

Published: 16 October 2013 Publication History

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.

References

[1]

M. Bertogna, G. Buttazzo, M. Marinoni, G. Yao, F. Esposito, and M. Caccamo. Preemption points placement for sporadic task sets. In Proc. 22^th Euromicro Conf. on Real-Time Systems (ECRTS), pages 251--260, July 2010.

Digital Library

[2]

M. Bertogna, G. Buttazzo, and G. Yao. Improving feasibility of fixed priority tasks using non-preemptive regions. In Proc. 32^nd Real-Time Systems Symposium (RTSS), pages 251--260, Dec. 2011.

Digital Library

[3]

M. Bertogna, O. Xhani, M. Marinoni, F. Esposito, and G. Buttazzo. Optimal selection of preemption points to minimize preemption overhead. In Proc. 23^rd Euromicro Conf. on Real-Time Systems (ECRTS), pages 217--227, July 2011.

Digital Library

[4]

E. Bini and G. Buttazzo. Biasing effects in schedulability measures. In Proc. 16^th Euromicro Conf. on Real-Time Systems (ECRTS), pages 196--203, July 2004.

Digital Library

[5]

R. Bril, J. Lukkien, and W. Verhaegh. Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption. Real-Time Systems Journal, 42(1-3): 63--119, Aug. 2009.

Digital Library

[6]

R. Bril, M. van den Heuvel, U. Keskin, and J. Lukkien. Generalized fixed-priority scheduling with limited preemptions. In Proc. 24^th Euromicro Conf. on Real-Time Systems (ECRTS), pages 209--220, July 2012.

Digital Library

[7]

A. Burns. Preemptive priority based scheduling: An appropriate engineering approach. In S. Son, editor, Advances in Real-Time Systems, pages 225--248. Prentice-Hall, 1994.

Digital Library

[8]

G. Buttazzo, M. Bertogna, and G. Yao. Limited preemptive scheduling for real-time systems: A survey. IEEE Transaction on Industrial Informatics (TII), 9(1): 3--15, Feb. 2013.

[9]

R. I. Davis and M. Bertogna. Optimal fixed priority scheduling with deferred pre-emption. In Proc. 33^rd Real-Time Systems Symposium (RTSS), pages 39--50, Dec. 2012.

Digital Library

[10]

P. Gai, G. Lipari, and M. Di Natale. Minimizing memory utilization of real-time task sets in single and multi-processor systems-on-a-chip. In Proc. 22^nd Real-Time Systems Symposium (RTSS), pages 73--83, Dec. 2001.

Digital Library

[11]

M. González Harbour, M. Klein, and J. Lehoczky. Fixed-priority scheduling with varying execution priority. In Proc. 12^th Real-Time Systems Symposium (RTSS), pages 116--128, Dec. 1991.

[12]

U. Keskin, R. J. Bril, and J. J. Lukkien. Exact response-time analysis for fixed-priority preemption-threshold scheduling. In Proc. IEEE Conference on Emerging Technologies and Factory Automation (ETFA), Work-in-Progress Session, Sep. 2010.

[13]

R. Koymans. Specifying real-time properties with metric temporal logic. Real-Time Systems Journal, 2(4): 255--299, Nov. 1990.

Digital Library

[14]

C. Liu and J. Layland. Scheduling algorithms for multiprogramming in a real-time environment. Journal of the ACM, 20(1): 46--61, Jan. 1973.

Digital Library

[15]

V. Lortz and K. Shin. Semaphore queue priority assignment for real-time multiprocessor synchronization. IEEE Transactions on Software Engineering (TSE), 21(10): 834--844, Oct. 1995.

Digital Library

[16]

M. Park, H. Yoo, and J. Chae. Integration of preemption threshold and quantum-based scheduling for schedulability enhancement of fixed priority tasks. In Proc. 15^th Conf. on Embedded and Real-Time Computing Systems and Applications (RTCSA), pages 503--510, Aug. 2009.

Digital Library

[17]

J. Regehr. Scheduling tasks with mixed preemption relations for robustness to timing faults. In Proc. 23^rd Real-Time Systems Symposium (RTSS), pages 315--326, Dec. 2002.

Digital Library

[18]

M. Saksena and Y. Wang. Scalable real-time system design using preemption thresholds. In Proc. 21^st Real-Time Systems Symposium (RTSS), pages 25--34, Dec. 2000.

Digital Library

[19]

I. Shin, M. Behnam, T. Nolte, and M. Nolin. Synthesis of optimal interfaces for hierarchical scheduling with resources. In Proc. 29^th Real-Time Systems Symposium (RTSS), pages 209--220, Dec. 2008.

Digital Library

[20]

Y. Wang and M. Saksena. Scheduling fixed-priority tasks with preemption threshold. In Proc. 6^th Conf. on Real-Time Computing Systems and Applications (RTCSA), pages 328--335, Dec. 1999.

Digital Library

[21]

G. Yao and G. Buttazzo. Reducing stack with intra-task threshold priorities in real-time systems. In Proc. 10^th Conference on Embedded Software (EMSOFT), pages 109--118, Oct. 2010.

Digital Library

[22]

G. Yao, G. Buttazzo, and M. Bertogna. Bounding the maximum length of non-preemptive regions under fixed-priority scheduling. In Proc. 15^th Conf. on Embedded and Real-Time Computing Systems and Applications (RTCSA), pages 351--360, Aug. 2009.

Digital Library

Cited By

Amert TNemitz C(2024)Taking One for the Team: Trading Overhead and Blocking for Optimal Critical-Section Granularity with a Shared GPUProceedings of the 32nd International Conference on Real-Time Networks and Systems10.1145/3696355.3696368(94-104)Online publication date: 6-Nov-2024
https://dl.acm.org/doi/10.1145/3696355.3696368
Cavicchio JFisher N(2020)Integrating Preemption Thresholds with Limited Preemption Scheduling2020 IEEE 26th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)10.1109/RTCSA50079.2020.9203646(1-10)Online publication date: Aug-2020
https://doi.org/10.1109/RTCSA50079.2020.9203646
Nelissen GBiondi A(2018)The SRP Resource Sharing Protocol for Self-Suspending Tasks2018 IEEE Real-Time Systems Symposium (RTSS)10.1109/RTSS.2018.00051(361-372)Online publication date: Dec-2018
https://doi.org/10.1109/RTSS.2018.00051
Show More Cited By

Improved feasibility of fixed-priority scheduling with deferred preemption using preemption thresholds for preemption points
1. Software and its engineering
  1. Software creation and management
    1. Software verification and validation
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
    2. Online algorithms
      1. Online learning algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning

Recommendations

Global and Partitioned Multiprocessor Fixed Priority Scheduling with Deferred Preemption
Special Issue on Embedded Platforms for Crypto and Regular Papers

This article introduces schedulability analysis for Global Fixed Priority Scheduling with Deferred Preemption (gFPDS) for homogeneous multiprocessor systems. gFPDS is a superset of Global Fixed Priority Preemptive Scheduling (gFPPS) and Global Fixed ...
Scheduling Fixed-Priority Tasks with Preemption Threshold
RTCSA '99: Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications

The notion of preemption threshold is initiated in the industry to provide flexibility for real-time and embedded system designs. However, it also brings new contents to scheduling theory. Historically, the scheduling model are divided into two ...
Optimal priority and threshold assignment for fixed-priority preemption threshold scheduling
Special Issue on Embedded Operating Systems Workshop (EWiLi '16)

Fixed-priority preemption-threshold scheduling (FPTS) is a generalization of fixed-priority preemptive scheduling (FPPS) and fixed-priority non-preemptive scheduling (FPNS). Since FPPS and FPNS are incomparable in terms of potential schedulability, FPTS ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

RTNS '13: Proceedings of the 21st International conference on Real-Time Networks and Systems

October 2013

298 pages

ISBN:9781450320580

DOI:10.1145/2516821

General Chairs:
Michel Auguin
LEAT, Nice, France
,
Robert de Simone
INRIA, Sophia Antipolis, France
,
Program Chairs:
Robert Davis
University of York, UK
,
Emmanuel Grolleau
LIAS, ISAE-ENSMA, France

Copyright © 2013 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

CNRS: Centre National De La Rechercue Scientifique
INRIA: Institut Natl de Recherche en Info et en Automatique

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 October 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Conference

RTNS 2013

Sponsor:

CNRS
INRIA

RTNS 2013: 21st International Conference on Real-Time Networks and Systems

October 16 - 18, 2013

Sophia Antipolis, France

Acceptance Rates

RTNS '13 Paper Acceptance Rate 29 of 62 submissions, 47%;

Overall Acceptance Rate 119 of 255 submissions, 47%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
144
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Amert TNemitz C(2024)Taking One for the Team: Trading Overhead and Blocking for Optimal Critical-Section Granularity with a Shared GPUProceedings of the 32nd International Conference on Real-Time Networks and Systems10.1145/3696355.3696368(94-104)Online publication date: 6-Nov-2024
https://dl.acm.org/doi/10.1145/3696355.3696368
Cavicchio JFisher N(2020)Integrating Preemption Thresholds with Limited Preemption Scheduling2020 IEEE 26th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)10.1109/RTCSA50079.2020.9203646(1-10)Online publication date: Aug-2020
https://doi.org/10.1109/RTCSA50079.2020.9203646
Nelissen GBiondi A(2018)The SRP Resource Sharing Protocol for Self-Suspending Tasks2018 IEEE Real-Time Systems Symposium (RTSS)10.1109/RTSS.2018.00051(361-372)Online publication date: Dec-2018
https://doi.org/10.1109/RTSS.2018.00051
Kim S(2017)Efficient exact Boolean schedulability tests for fixed priority preemption threshold schedulingJournal of Systems and Software10.1016/j.jss.2017.09.008134:C(153-169)Online publication date: 1-Dec-2017
https://dl.acm.org/doi/10.1016/j.jss.2017.09.008
Nasri MNelissen GFohler G(2016)A New Approach for Limited Preemptive Scheduling in Systems with Preemption Overhead2016 28th Euromicro Conference on Real-Time Systems (ECRTS)10.1109/ECRTS.2016.15(25-35)Online publication date: Jul-2016
https://doi.org/10.1109/ECRTS.2016.15
van den Heuvel MBril RLukkien J(2015)Budget allocations for hierarchical fixed-priority scheduling of sporadic tasks with deferred preemptions upon EDP resourcesACM SIGBED Review10.1145/2752801.275280412:1(19-27)Online publication date: 27-Mar-2015
https://dl.acm.org/doi/10.1145/2752801.2752804
Becker MKhalilzad NBril RNolte T(2015)Extended support for limited preemption fixed priority scheduling for OSEK/AUTOSAR-compliant operating systems10th IEEE International Symposium on Industrial Embedded Systems (SIES)10.1109/SIES.2015.7185062(1-11)Online publication date: Jun-2015
https://doi.org/10.1109/SIES.2015.7185062

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten