Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays:: integrated analysis and evaluation

Reinder Bril; Sebastian Altmeyer; Martijn van den Heuvel; Robert Ian Davis; Moris Benham

doi:10.1007/s11241-016-9266-z

Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation

Reinder Bril, Sebastian Altmeyer, Martijn van den Heuvel, Robert Ian Davis, Moris Benham

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

Commercial off-the-shelf programmable platforms for real-time systems typically contain a cache to bridge the gap between the processor speed and main memory speed. Because cache-related pre-emption delays (CRPD) can have a significant influence on the computation times of tasks, CRPD have been integrated in the response time analysis for fixed-priority pre-emptive scheduling (FPPS). This paper presents CRPD aware response-time analysis of sporadic tasks with arbitrary deadlines for fixed-priority pre-emption threshold scheduling (FPTS), generalizing earlier work. The analysis is complemented by an optimal (pre-emption) threshold assignment algorithm, assuming the priorities of tasks are given. We further improve upon these results by presenting an algorithm that searches for a layout of tasks in memory that makes a task set schedulable. The paper includes an extensive comparative evaluation of the schedulability ratios of FPPS and FPTS, taking CRPD into account. The practical relevance of our work stems from FPTS support in AUTOSAR, a standardized development model for the automotive industry.

Original language	English
Pages (from-to)	1-64
Number of pages	64
Journal	Real-Time Systems
DOIs	https://doi.org/10.1007/s11241-016-9266-z
Publication status	Published - 31 Jan 2017

Bibliographical note

Keywords

real time
scheduling
fixed priority
preemption thressholds
CRPD
cache related preemption delays

Access to Document

10.1007/s11241-016-9266-z

Bril_et_al-2017-Real-Time_Systems
© The Author(s) 2017
Final published version, 3.38 MBLicence: CC BY

Cite this

@article{7a286fc849c94ad3a806ec4fcc666006,

title = "Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays:: integrated analysis and evaluation",

abstract = "Commercial off-the-shelf programmable platforms for real-time systems typically contain a cache to bridge the gap between the processor speed and main memory speed. Because cache-related pre-emption delays (CRPD) can have a significant influence on the computation times of tasks, CRPD have been integrated in the response time analysis for fixed-priority pre-emptive scheduling (FPPS). This paper presents CRPD aware response-time analysis of sporadic tasks with arbitrary deadlines for fixed-priority pre-emption threshold scheduling (FPTS), generalizing earlier work. The analysis is complemented by an optimal (pre-emption) threshold assignment algorithm, assuming the priorities of tasks are given. We further improve upon these results by presenting an algorithm that searches for a layout of tasks in memory that makes a task set schedulable. The paper includes an extensive comparative evaluation of the schedulability ratios of FPPS and FPTS, taking CRPD into account. The practical relevance of our work stems from FPTS support in AUTOSAR, a standardized development model for the automotive industry.",

keywords = "real time, scheduling, fixed priority, preemption thressholds, CRPD, cache related preemption delays",

author = "Reinder Bril and Sebastian Altmeyer and {van den Heuvel}, Martijn and Davis, {Robert Ian} and Moris Benham",

note = "{\textcopyright} The Author(s) 2017",

year = "2017",

month = jan,

day = "31",

doi = "10.1007/s11241-016-9266-z",

language = "English",

pages = "1--64",

journal = "Real-Time Systems",

issn = "0922-6443",

publisher = "Springer",

}

TY - JOUR

T1 - Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays:

T2 - integrated analysis and evaluation

AU - Bril, Reinder

AU - Altmeyer, Sebastian

AU - van den Heuvel, Martijn

AU - Davis, Robert Ian

AU - Benham, Moris

N1 - © The Author(s) 2017

PY - 2017/1/31

Y1 - 2017/1/31

N2 - Commercial off-the-shelf programmable platforms for real-time systems typically contain a cache to bridge the gap between the processor speed and main memory speed. Because cache-related pre-emption delays (CRPD) can have a significant influence on the computation times of tasks, CRPD have been integrated in the response time analysis for fixed-priority pre-emptive scheduling (FPPS). This paper presents CRPD aware response-time analysis of sporadic tasks with arbitrary deadlines for fixed-priority pre-emption threshold scheduling (FPTS), generalizing earlier work. The analysis is complemented by an optimal (pre-emption) threshold assignment algorithm, assuming the priorities of tasks are given. We further improve upon these results by presenting an algorithm that searches for a layout of tasks in memory that makes a task set schedulable. The paper includes an extensive comparative evaluation of the schedulability ratios of FPPS and FPTS, taking CRPD into account. The practical relevance of our work stems from FPTS support in AUTOSAR, a standardized development model for the automotive industry.

AB - Commercial off-the-shelf programmable platforms for real-time systems typically contain a cache to bridge the gap between the processor speed and main memory speed. Because cache-related pre-emption delays (CRPD) can have a significant influence on the computation times of tasks, CRPD have been integrated in the response time analysis for fixed-priority pre-emptive scheduling (FPPS). This paper presents CRPD aware response-time analysis of sporadic tasks with arbitrary deadlines for fixed-priority pre-emption threshold scheduling (FPTS), generalizing earlier work. The analysis is complemented by an optimal (pre-emption) threshold assignment algorithm, assuming the priorities of tasks are given. We further improve upon these results by presenting an algorithm that searches for a layout of tasks in memory that makes a task set schedulable. The paper includes an extensive comparative evaluation of the schedulability ratios of FPPS and FPTS, taking CRPD into account. The practical relevance of our work stems from FPTS support in AUTOSAR, a standardized development model for the automotive industry.

KW - real time

KW - scheduling

KW - fixed priority

KW - preemption thressholds

KW - CRPD

KW - cache related preemption delays

UR - https://www-users.cs.york.ac.uk/~robdavis/

UR - http://link.springer.com/article/10.1007/s11241-016-9266-z

U2 - 10.1007/s11241-016-9266-z

DO - 10.1007/s11241-016-9266-z

M3 - Article

SN - 0922-6443

SP - 1

EP - 64

JO - Real-Time Systems

JF - Real-Time Systems

ER -