Exact response-time analysis for fixed-priority preemption-threshold scheduling

U. Keskin; R.J. Bril; J.J. Lukkien

doi:10.1109/ETFA.2010.5640984

Exact response-time analysis for fixed-priority preemption-threshold scheduling

U. Keskin, R.J. Bril, J.J. Lukkien

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

38 Citations (Scopus)

3 Downloads (Pure)

Abstract

Fixed-priority preemption-threshold scheduling (FPTS) has been proposed as a generalization of fixed-priority preemptive scheduling (FPPS) and fixed-priority non-preemptive scheduling (FPNS) with the aim to improve schedulability and reduce run-time overheads. In this paper, we show that the existing worst-case response time (WCRT) analysis for FPTS is pessimistic and present an exact WCRT analysis. Moreover, we refine the task model for FPTS, making FPTS also a generalization of fixed-priority scheduling with deferred preemption (FPDS). Finally, we present exact analysis for FPTS for this refined task model and an example showing that FPTS can improve on FPPS and FPDS.

Original language	English
Title of host publication	Proceedings of the 15th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA 2010, Bilbao, Spain, September 13-16, 2010)
Publisher	Institute of Electrical and Electronics Engineers
Pages	1-4
ISBN (Print)	978-1-4244-6848-5
DOIs	https://doi.org/10.1109/ETFA.2010.5640984
Publication status	Published - 2010

Access to Document

10.1109/ETFA.2010.5640984

Cite this

Keskin, U., Bril, R. J., & Lukkien, J. J. (2010). Exact response-time analysis for fixed-priority preemption-threshold scheduling. In Proceedings of the 15th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA 2010, Bilbao, Spain, September 13-16, 2010) (pp. 1-4). Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ETFA.2010.5640984

@inproceedings{d828a31e074a4ac3a4e63e6dfcad9a39,

title = "Exact response-time analysis for fixed-priority preemption-threshold scheduling",

abstract = "Fixed-priority preemption-threshold scheduling (FPTS) has been proposed as a generalization of fixed-priority preemptive scheduling (FPPS) and fixed-priority non-preemptive scheduling (FPNS) with the aim to improve schedulability and reduce run-time overheads. In this paper, we show that the existing worst-case response time (WCRT) analysis for FPTS is pessimistic and present an exact WCRT analysis. Moreover, we refine the task model for FPTS, making FPTS also a generalization of fixed-priority scheduling with deferred preemption (FPDS). Finally, we present exact analysis for FPTS for this refined task model and an example showing that FPTS can improve on FPPS and FPDS.",

author = "U. Keskin and R.J. Bril and J.J. Lukkien",

year = "2010",

doi = "10.1109/ETFA.2010.5640984",

language = "English",

isbn = "978-1-4244-6848-5",

pages = "1--4",

booktitle = "Proceedings of the 15th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA 2010, Bilbao, Spain, September 13-16, 2010)",

publisher = "Institute of Electrical and Electronics Engineers",

address = "United States",

}

Keskin, U, Bril, RJ & Lukkien, JJ 2010, Exact response-time analysis for fixed-priority preemption-threshold scheduling. in Proceedings of the 15th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA 2010, Bilbao, Spain, September 13-16, 2010). Institute of Electrical and Electronics Engineers, pp. 1-4. https://doi.org/10.1109/ETFA.2010.5640984

Exact response-time analysis for fixed-priority preemption-threshold scheduling. / Keskin, U.; Bril, R.J.; Lukkien, J.J.
Proceedings of the 15th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA 2010, Bilbao, Spain, September 13-16, 2010). Institute of Electrical and Electronics Engineers, 2010. p. 1-4.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Exact response-time analysis for fixed-priority preemption-threshold scheduling

AU - Keskin, U.

AU - Bril, R.J.

AU - Lukkien, J.J.

PY - 2010

Y1 - 2010

N2 - Fixed-priority preemption-threshold scheduling (FPTS) has been proposed as a generalization of fixed-priority preemptive scheduling (FPPS) and fixed-priority non-preemptive scheduling (FPNS) with the aim to improve schedulability and reduce run-time overheads. In this paper, we show that the existing worst-case response time (WCRT) analysis for FPTS is pessimistic and present an exact WCRT analysis. Moreover, we refine the task model for FPTS, making FPTS also a generalization of fixed-priority scheduling with deferred preemption (FPDS). Finally, we present exact analysis for FPTS for this refined task model and an example showing that FPTS can improve on FPPS and FPDS.

AB - Fixed-priority preemption-threshold scheduling (FPTS) has been proposed as a generalization of fixed-priority preemptive scheduling (FPPS) and fixed-priority non-preemptive scheduling (FPNS) with the aim to improve schedulability and reduce run-time overheads. In this paper, we show that the existing worst-case response time (WCRT) analysis for FPTS is pessimistic and present an exact WCRT analysis. Moreover, we refine the task model for FPTS, making FPTS also a generalization of fixed-priority scheduling with deferred preemption (FPDS). Finally, we present exact analysis for FPTS for this refined task model and an example showing that FPTS can improve on FPPS and FPDS.

U2 - 10.1109/ETFA.2010.5640984

DO - 10.1109/ETFA.2010.5640984

M3 - Conference contribution

SN - 978-1-4244-6848-5

SP - 1

EP - 4

BT - Proceedings of the 15th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA 2010, Bilbao, Spain, September 13-16, 2010)

PB - Institute of Electrical and Electronics Engineers

ER -

Exact response-time analysis for fixed-priority preemption-threshold scheduling

Abstract

Access to Document

Fingerprint

Cite this