Best-case response times of real-time tasks under fixed-priority scheduling with preemption thresholds

H.J. Rivera Verduzco; R.J. Bril

doi:10.1145/3139258.3139260

Best-case response times of real-time tasks under fixed-priority scheduling with preemption thresholds

H.J. Rivera Verduzco
, R.J. Bril

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/Congresprocedure › Conferentiebijdrage › Academic › peer review

4 Citaten (Scopus)

Samenvatting

Compared to fixed-priority preemptive scheduling (FPPS), fixedpriority
scheduling with preemption thresholds (FPTS) reduces memory
requirements, the cost of arbitrary preemptions, and it has been
shown to improve the schedulability ratio of task-sets. FPTS has
been viewed as a potential successor to FPPS as a de facto standard
in industry, where it is already supported by both OSEK and
AUTOSAR compliant operating systems.

In this paper, we present and prove a novel exact best-case response
time analysis for independent real-time periodic tasks with
arbitrary deadlines scheduled using FPTS. Moreover, we present
an evaluation of our novel analysis for FPTS with the best-case
response time analysis for FPPS when ignoring the tasks that cannot
preempt a task. For the majority of the cases in our evaluation,
the best-case response time analysis for FPPS yields a tight lower
bound for the response time of a task scheduled using FPTS.

Originele taal-2	Engels
Titel	RTNS '17 Proceedings of the 25th International Conference on Real-Time Networks and Systems, 4-6 October 2017, Grenoble, France
Plaats van productie	New York
Uitgeverij	Association for Computing Machinery, Inc.
Pagina's	307-316
Aantal pagina's	10
ISBN van elektronische versie	9781450352864
ISBN van geprinte versie	978-1-4503-5286-4
DOI's	https://doi.org/10.1145/3139258.3139260
Status	Gepubliceerd - 4 okt. 2017

Toegang tot document

10.1145/3139258.3139260

Andere bestanden en links

Link to publication in Scopus

Citeer dit

Rivera Verduzco, H. J., & Bril, R. J. (2017). Best-case response times of real-time tasks under fixed-priority scheduling with preemption thresholds. In RTNS '17 Proceedings of the 25th International Conference on Real-Time Networks and Systems, 4-6 October 2017, Grenoble, France (blz. 307-316). Association for Computing Machinery, Inc.. https://doi.org/10.1145/3139258.3139260

@inproceedings{0b750dda060d48d49848d99f2c5d512c,

title = "Best-case response times of real-time tasks under fixed-priority scheduling with preemption thresholds",

abstract = "Compared to fixed-priority preemptive scheduling (FPPS), fixedpriority scheduling with preemption thresholds (FPTS) reduces memory requirements, the cost of arbitrary preemptions, and it has been shown to improve the schedulability ratio of task-sets. FPTS has been viewed as a potential successor to FPPS as a de facto standard in industry, where it is already supported by both OSEK and AUTOSAR compliant operating systems. In this paper, we present and prove a novel exact best-case response time analysis for independent real-time periodic tasks with arbitrary deadlines scheduled using FPTS. Moreover, we present an evaluation of our novel analysis for FPTS with the best-case response time analysis for FPPS when ignoring the tasks that cannot preempt a task. For the majority of the cases in our evaluation, the best-case response time analysis for FPPS yields a tight lower bound for the response time of a task scheduled using FPTS.",

keywords = "Best-case, Preemption thresholds, Response time",

author = "\{Rivera Verduzco\}, H.J. and R.J. Bril",

year = "2017",

month = oct,

day = "4",

doi = "10.1145/3139258.3139260",

language = "English",

isbn = "978-1-4503-5286-4",

pages = "307--316",

booktitle = "RTNS '17 Proceedings of the 25th International Conference on Real-Time Networks and Systems, 4-6 October 2017, Grenoble, France",

publisher = "Association for Computing Machinery, Inc.",

address = "United States",

}

Rivera Verduzco, HJ & Bril, RJ 2017, Best-case response times of real-time tasks under fixed-priority scheduling with preemption thresholds. in RTNS '17 Proceedings of the 25th International Conference on Real-Time Networks and Systems, 4-6 October 2017, Grenoble, France. Association for Computing Machinery, Inc., New York, blz. 307-316. https://doi.org/10.1145/3139258.3139260

Best-case response times of real-time tasks under fixed-priority scheduling with preemption thresholds. / Rivera Verduzco, H.J.; Bril, R.J.
RTNS '17 Proceedings of the 25th International Conference on Real-Time Networks and Systems, 4-6 October 2017, Grenoble, France. New York: Association for Computing Machinery, Inc., 2017. blz. 307-316.

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/Congresprocedure › Conferentiebijdrage › Academic › peer review

TY - GEN

T1 - Best-case response times of real-time tasks under fixed-priority scheduling with preemption thresholds

AU - Rivera Verduzco, H.J.

AU - Bril, R.J.

PY - 2017/10/4

Y1 - 2017/10/4

N2 - Compared to fixed-priority preemptive scheduling (FPPS), fixedpriority scheduling with preemption thresholds (FPTS) reduces memory requirements, the cost of arbitrary preemptions, and it has been shown to improve the schedulability ratio of task-sets. FPTS has been viewed as a potential successor to FPPS as a de facto standard in industry, where it is already supported by both OSEK and AUTOSAR compliant operating systems. In this paper, we present and prove a novel exact best-case response time analysis for independent real-time periodic tasks with arbitrary deadlines scheduled using FPTS. Moreover, we present an evaluation of our novel analysis for FPTS with the best-case response time analysis for FPPS when ignoring the tasks that cannot preempt a task. For the majority of the cases in our evaluation, the best-case response time analysis for FPPS yields a tight lower bound for the response time of a task scheduled using FPTS.

AB - Compared to fixed-priority preemptive scheduling (FPPS), fixedpriority scheduling with preemption thresholds (FPTS) reduces memory requirements, the cost of arbitrary preemptions, and it has been shown to improve the schedulability ratio of task-sets. FPTS has been viewed as a potential successor to FPPS as a de facto standard in industry, where it is already supported by both OSEK and AUTOSAR compliant operating systems. In this paper, we present and prove a novel exact best-case response time analysis for independent real-time periodic tasks with arbitrary deadlines scheduled using FPTS. Moreover, we present an evaluation of our novel analysis for FPTS with the best-case response time analysis for FPPS when ignoring the tasks that cannot preempt a task. For the majority of the cases in our evaluation, the best-case response time analysis for FPPS yields a tight lower bound for the response time of a task scheduled using FPTS.

KW - Best-case

KW - Preemption thresholds

KW - Response time

UR - https://www.scopus.com/pages/publications/85037376904

U2 - 10.1145/3139258.3139260

DO - 10.1145/3139258.3139260

M3 - Conference contribution

SN - 978-1-4503-5286-4

SP - 307

EP - 316

BT - RTNS '17 Proceedings of the 25th International Conference on Real-Time Networks and Systems, 4-6 October 2017, Grenoble, France

PB - Association for Computing Machinery, Inc.

CY - New York

ER -

Best-case response times of real-time tasks under fixed-priority scheduling with preemption thresholds

Samenvatting

Toegang tot document

Andere bestanden en links

Vingerafdruk

Citeer dit