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...
Ausführliche Beschreibung
Autor*in: |
Bril, Reinder J. [verfasserIn] |
---|
Format: |
Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2017 |
---|
Schlagwörter: |
Fixed-priority pre-emptive scheduling Fixed-priority scheduling with pre-emption thresholds |
---|
Anmerkung: |
© The Author(s) 2017 |
---|
Übergeordnetes Werk: |
Enthalten in: Real-time systems - Springer US, 1989, 53(2017), 4 vom: 31. Jan., Seite 403-466 |
---|---|
Übergeordnetes Werk: |
volume:53 ; year:2017 ; number:4 ; day:31 ; month:01 ; pages:403-466 |
Links: |
---|
DOI / URN: |
10.1007/s11241-016-9266-z |
---|
Katalog-ID: |
OLC2054361534 |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | OLC2054361534 | ||
003 | DE-627 | ||
005 | 20230504062506.0 | ||
007 | tu | ||
008 | 200819s2017 xx ||||| 00| ||eng c | ||
024 | 7 | |a 10.1007/s11241-016-9266-z |2 doi | |
035 | |a (DE-627)OLC2054361534 | ||
035 | |a (DE-He213)s11241-016-9266-z-p | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
082 | 0 | 4 | |a 004 |q VZ |
100 | 1 | |a Bril, Reinder J. |e verfasserin |4 aut | |
245 | 1 | 0 | |a Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation |
264 | 1 | |c 2017 | |
336 | |a Text |b txt |2 rdacontent | ||
337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
338 | |a Band |b nc |2 rdacarrier | ||
500 | |a © The Author(s) 2017 | ||
520 | |a 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. [(This paper forms an extended version of Bril et al. (in Proceedings of 35th IEEE real-time systems symposium (RTSS), 2014). The main extensions are described in Sect. 1.2.] | ||
650 | 4 | |a Fixed-priority pre-emptive scheduling | |
650 | 4 | |a Fixed-priority scheduling with pre-emption thresholds | |
650 | 4 | |a Cache-related pre-emption delay | |
650 | 4 | |a Response-time analysis | |
700 | 1 | |a Altmeyer, Sebastian |4 aut | |
700 | 1 | |a van den Heuvel, Martijn M. H. P. |4 aut | |
700 | 1 | |a Davis, Robert I. |4 aut | |
700 | 1 | |a Behnam, Moris |4 aut | |
773 | 0 | 8 | |i Enthalten in |t Real-time systems |d Springer US, 1989 |g 53(2017), 4 vom: 31. Jan., Seite 403-466 |w (DE-627)130955892 |w (DE-600)1064543-3 |w (DE-576)025100394 |x 0922-6443 |7 nnns |
773 | 1 | 8 | |g volume:53 |g year:2017 |g number:4 |g day:31 |g month:01 |g pages:403-466 |
856 | 4 | 1 | |u https://doi.org/10.1007/s11241-016-9266-z |z lizenzpflichtig |3 Volltext |
912 | |a GBV_USEFLAG_A | ||
912 | |a SYSFLAG_A | ||
912 | |a GBV_OLC | ||
912 | |a SSG-OLC-TEC | ||
912 | |a SSG-OLC-MAT | ||
912 | |a GBV_ILN_24 | ||
912 | |a GBV_ILN_70 | ||
912 | |a GBV_ILN_4036 | ||
951 | |a AR | ||
952 | |d 53 |j 2017 |e 4 |b 31 |c 01 |h 403-466 |
author_variant |
r j b rj rjb s a sa d h m m h p v dhmmhp dhmmhpv r i d ri rid m b mb |
---|---|
matchkey_str |
article:09226443:2017----::iepirtshdlnwtpemtotrsodadahrltdrepineasn |
hierarchy_sort_str |
2017 |
publishDate |
2017 |
allfields |
10.1007/s11241-016-9266-z doi (DE-627)OLC2054361534 (DE-He213)s11241-016-9266-z-p DE-627 ger DE-627 rakwb eng 004 VZ Bril, Reinder J. verfasserin aut Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2017 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. [(This paper forms an extended version of Bril et al. (in Proceedings of 35th IEEE real-time systems symposium (RTSS), 2014). The main extensions are described in Sect. 1.2.] Fixed-priority pre-emptive scheduling Fixed-priority scheduling with pre-emption thresholds Cache-related pre-emption delay Response-time analysis Altmeyer, Sebastian aut van den Heuvel, Martijn M. H. P. aut Davis, Robert I. aut Behnam, Moris aut Enthalten in Real-time systems Springer US, 1989 53(2017), 4 vom: 31. Jan., Seite 403-466 (DE-627)130955892 (DE-600)1064543-3 (DE-576)025100394 0922-6443 nnns volume:53 year:2017 number:4 day:31 month:01 pages:403-466 https://doi.org/10.1007/s11241-016-9266-z lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_24 GBV_ILN_70 GBV_ILN_4036 AR 53 2017 4 31 01 403-466 |
spelling |
10.1007/s11241-016-9266-z doi (DE-627)OLC2054361534 (DE-He213)s11241-016-9266-z-p DE-627 ger DE-627 rakwb eng 004 VZ Bril, Reinder J. verfasserin aut Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2017 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. [(This paper forms an extended version of Bril et al. (in Proceedings of 35th IEEE real-time systems symposium (RTSS), 2014). The main extensions are described in Sect. 1.2.] Fixed-priority pre-emptive scheduling Fixed-priority scheduling with pre-emption thresholds Cache-related pre-emption delay Response-time analysis Altmeyer, Sebastian aut van den Heuvel, Martijn M. H. P. aut Davis, Robert I. aut Behnam, Moris aut Enthalten in Real-time systems Springer US, 1989 53(2017), 4 vom: 31. Jan., Seite 403-466 (DE-627)130955892 (DE-600)1064543-3 (DE-576)025100394 0922-6443 nnns volume:53 year:2017 number:4 day:31 month:01 pages:403-466 https://doi.org/10.1007/s11241-016-9266-z lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_24 GBV_ILN_70 GBV_ILN_4036 AR 53 2017 4 31 01 403-466 |
allfields_unstemmed |
10.1007/s11241-016-9266-z doi (DE-627)OLC2054361534 (DE-He213)s11241-016-9266-z-p DE-627 ger DE-627 rakwb eng 004 VZ Bril, Reinder J. verfasserin aut Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2017 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. [(This paper forms an extended version of Bril et al. (in Proceedings of 35th IEEE real-time systems symposium (RTSS), 2014). The main extensions are described in Sect. 1.2.] Fixed-priority pre-emptive scheduling Fixed-priority scheduling with pre-emption thresholds Cache-related pre-emption delay Response-time analysis Altmeyer, Sebastian aut van den Heuvel, Martijn M. H. P. aut Davis, Robert I. aut Behnam, Moris aut Enthalten in Real-time systems Springer US, 1989 53(2017), 4 vom: 31. Jan., Seite 403-466 (DE-627)130955892 (DE-600)1064543-3 (DE-576)025100394 0922-6443 nnns volume:53 year:2017 number:4 day:31 month:01 pages:403-466 https://doi.org/10.1007/s11241-016-9266-z lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_24 GBV_ILN_70 GBV_ILN_4036 AR 53 2017 4 31 01 403-466 |
allfieldsGer |
10.1007/s11241-016-9266-z doi (DE-627)OLC2054361534 (DE-He213)s11241-016-9266-z-p DE-627 ger DE-627 rakwb eng 004 VZ Bril, Reinder J. verfasserin aut Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2017 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. [(This paper forms an extended version of Bril et al. (in Proceedings of 35th IEEE real-time systems symposium (RTSS), 2014). The main extensions are described in Sect. 1.2.] Fixed-priority pre-emptive scheduling Fixed-priority scheduling with pre-emption thresholds Cache-related pre-emption delay Response-time analysis Altmeyer, Sebastian aut van den Heuvel, Martijn M. H. P. aut Davis, Robert I. aut Behnam, Moris aut Enthalten in Real-time systems Springer US, 1989 53(2017), 4 vom: 31. Jan., Seite 403-466 (DE-627)130955892 (DE-600)1064543-3 (DE-576)025100394 0922-6443 nnns volume:53 year:2017 number:4 day:31 month:01 pages:403-466 https://doi.org/10.1007/s11241-016-9266-z lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_24 GBV_ILN_70 GBV_ILN_4036 AR 53 2017 4 31 01 403-466 |
allfieldsSound |
10.1007/s11241-016-9266-z doi (DE-627)OLC2054361534 (DE-He213)s11241-016-9266-z-p DE-627 ger DE-627 rakwb eng 004 VZ Bril, Reinder J. verfasserin aut Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation 2017 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2017 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. [(This paper forms an extended version of Bril et al. (in Proceedings of 35th IEEE real-time systems symposium (RTSS), 2014). The main extensions are described in Sect. 1.2.] Fixed-priority pre-emptive scheduling Fixed-priority scheduling with pre-emption thresholds Cache-related pre-emption delay Response-time analysis Altmeyer, Sebastian aut van den Heuvel, Martijn M. H. P. aut Davis, Robert I. aut Behnam, Moris aut Enthalten in Real-time systems Springer US, 1989 53(2017), 4 vom: 31. Jan., Seite 403-466 (DE-627)130955892 (DE-600)1064543-3 (DE-576)025100394 0922-6443 nnns volume:53 year:2017 number:4 day:31 month:01 pages:403-466 https://doi.org/10.1007/s11241-016-9266-z lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_24 GBV_ILN_70 GBV_ILN_4036 AR 53 2017 4 31 01 403-466 |
language |
English |
source |
Enthalten in Real-time systems 53(2017), 4 vom: 31. Jan., Seite 403-466 volume:53 year:2017 number:4 day:31 month:01 pages:403-466 |
sourceStr |
Enthalten in Real-time systems 53(2017), 4 vom: 31. Jan., Seite 403-466 volume:53 year:2017 number:4 day:31 month:01 pages:403-466 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
topic_facet |
Fixed-priority pre-emptive scheduling Fixed-priority scheduling with pre-emption thresholds Cache-related pre-emption delay Response-time analysis |
dewey-raw |
004 |
isfreeaccess_bool |
false |
container_title |
Real-time systems |
authorswithroles_txt_mv |
Bril, Reinder J. @@aut@@ Altmeyer, Sebastian @@aut@@ van den Heuvel, Martijn M. H. P. @@aut@@ Davis, Robert I. @@aut@@ Behnam, Moris @@aut@@ |
publishDateDaySort_date |
2017-01-31T00:00:00Z |
hierarchy_top_id |
130955892 |
dewey-sort |
14 |
id |
OLC2054361534 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2054361534</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504062506.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2017 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11241-016-9266-z</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2054361534</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11241-016-9266-z-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bril, Reinder J.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2017</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s) 2017</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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. [(This paper forms an extended version of Bril et al. (in Proceedings of 35th IEEE real-time systems symposium (RTSS), 2014). The main extensions are described in Sect. 1.2.]</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fixed-priority pre-emptive scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fixed-priority scheduling with pre-emption thresholds</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cache-related pre-emption delay</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Response-time analysis</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Altmeyer, Sebastian</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">van den Heuvel, Martijn M. H. P.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Davis, Robert I.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Behnam, Moris</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Real-time systems</subfield><subfield code="d">Springer US, 1989</subfield><subfield code="g">53(2017), 4 vom: 31. Jan., Seite 403-466</subfield><subfield code="w">(DE-627)130955892</subfield><subfield code="w">(DE-600)1064543-3</subfield><subfield code="w">(DE-576)025100394</subfield><subfield code="x">0922-6443</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:53</subfield><subfield code="g">year:2017</subfield><subfield code="g">number:4</subfield><subfield code="g">day:31</subfield><subfield code="g">month:01</subfield><subfield code="g">pages:403-466</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11241-016-9266-z</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4036</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">53</subfield><subfield code="j">2017</subfield><subfield code="e">4</subfield><subfield code="b">31</subfield><subfield code="c">01</subfield><subfield code="h">403-466</subfield></datafield></record></collection>
|
author |
Bril, Reinder J. |
spellingShingle |
Bril, Reinder J. ddc 004 misc Fixed-priority pre-emptive scheduling misc Fixed-priority scheduling with pre-emption thresholds misc Cache-related pre-emption delay misc Response-time analysis Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation |
authorStr |
Bril, Reinder J. |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)130955892 |
format |
Article |
dewey-ones |
004 - Data processing & computer science |
delete_txt_mv |
keep |
author_role |
aut aut aut aut aut |
collection |
OLC |
remote_str |
false |
illustrated |
Not Illustrated |
issn |
0922-6443 |
topic_title |
004 VZ Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation Fixed-priority pre-emptive scheduling Fixed-priority scheduling with pre-emption thresholds Cache-related pre-emption delay Response-time analysis |
topic |
ddc 004 misc Fixed-priority pre-emptive scheduling misc Fixed-priority scheduling with pre-emption thresholds misc Cache-related pre-emption delay misc Response-time analysis |
topic_unstemmed |
ddc 004 misc Fixed-priority pre-emptive scheduling misc Fixed-priority scheduling with pre-emption thresholds misc Cache-related pre-emption delay misc Response-time analysis |
topic_browse |
ddc 004 misc Fixed-priority pre-emptive scheduling misc Fixed-priority scheduling with pre-emption thresholds misc Cache-related pre-emption delay misc Response-time analysis |
format_facet |
Aufsätze Gedruckte Aufsätze |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
nc |
hierarchy_parent_title |
Real-time systems |
hierarchy_parent_id |
130955892 |
dewey-tens |
000 - Computer science, knowledge & systems |
hierarchy_top_title |
Real-time systems |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)130955892 (DE-600)1064543-3 (DE-576)025100394 |
title |
Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation |
ctrlnum |
(DE-627)OLC2054361534 (DE-He213)s11241-016-9266-z-p |
title_full |
Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation |
author_sort |
Bril, Reinder J. |
journal |
Real-time systems |
journalStr |
Real-time systems |
lang_code |
eng |
isOA_bool |
false |
dewey-hundreds |
000 - Computer science, information & general works |
recordtype |
marc |
publishDateSort |
2017 |
contenttype_str_mv |
txt |
container_start_page |
403 |
author_browse |
Bril, Reinder J. Altmeyer, Sebastian van den Heuvel, Martijn M. H. P. Davis, Robert I. Behnam, Moris |
container_volume |
53 |
class |
004 VZ |
format_se |
Aufsätze |
author-letter |
Bril, Reinder J. |
doi_str_mv |
10.1007/s11241-016-9266-z |
dewey-full |
004 |
title_sort |
fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation |
title_auth |
Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation |
abstract |
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. [(This paper forms an extended version of Bril et al. (in Proceedings of 35th IEEE real-time systems symposium (RTSS), 2014). The main extensions are described in Sect. 1.2.] © The Author(s) 2017 |
abstractGer |
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. [(This paper forms an extended version of Bril et al. (in Proceedings of 35th IEEE real-time systems symposium (RTSS), 2014). The main extensions are described in Sect. 1.2.] © The Author(s) 2017 |
abstract_unstemmed |
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. [(This paper forms an extended version of Bril et al. (in Proceedings of 35th IEEE real-time systems symposium (RTSS), 2014). The main extensions are described in Sect. 1.2.] © The Author(s) 2017 |
collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_24 GBV_ILN_70 GBV_ILN_4036 |
container_issue |
4 |
title_short |
Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation |
url |
https://doi.org/10.1007/s11241-016-9266-z |
remote_bool |
false |
author2 |
Altmeyer, Sebastian van den Heuvel, Martijn M. H. P. Davis, Robert I. Behnam, Moris |
author2Str |
Altmeyer, Sebastian van den Heuvel, Martijn M. H. P. Davis, Robert I. Behnam, Moris |
ppnlink |
130955892 |
mediatype_str_mv |
n |
isOA_txt |
false |
hochschulschrift_bool |
false |
doi_str |
10.1007/s11241-016-9266-z |
up_date |
2024-07-03T22:51:12.856Z |
_version_ |
1803600079472295936 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2054361534</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504062506.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2017 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11241-016-9266-z</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2054361534</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11241-016-9266-z-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bril, Reinder J.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2017</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s) 2017</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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. [(This paper forms an extended version of Bril et al. (in Proceedings of 35th IEEE real-time systems symposium (RTSS), 2014). The main extensions are described in Sect. 1.2.]</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fixed-priority pre-emptive scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fixed-priority scheduling with pre-emption thresholds</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cache-related pre-emption delay</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Response-time analysis</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Altmeyer, Sebastian</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">van den Heuvel, Martijn M. H. P.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Davis, Robert I.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Behnam, Moris</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Real-time systems</subfield><subfield code="d">Springer US, 1989</subfield><subfield code="g">53(2017), 4 vom: 31. Jan., Seite 403-466</subfield><subfield code="w">(DE-627)130955892</subfield><subfield code="w">(DE-600)1064543-3</subfield><subfield code="w">(DE-576)025100394</subfield><subfield code="x">0922-6443</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:53</subfield><subfield code="g">year:2017</subfield><subfield code="g">number:4</subfield><subfield code="g">day:31</subfield><subfield code="g">month:01</subfield><subfield code="g">pages:403-466</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11241-016-9266-z</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4036</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">53</subfield><subfield code="j">2017</subfield><subfield code="e">4</subfield><subfield code="b">31</subfield><subfield code="c">01</subfield><subfield code="h">403-466</subfield></datafield></record></collection>
|
score |
7.402297 |