{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T07:31:19Z","timestamp":1767857479355,"version":"3.49.0"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,1,31]],"date-time":"2017-01-31T00:00:00Z","timestamp":1485820800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003005","name":"Eindhoven University of Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003005","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Real-Time Syst"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s11241-016-9266-z","type":"journal-article","created":{"date-parts":[[2017,1,31]],"date-time":"2017-01-31T00:20:02Z","timestamp":1485822002000},"page":"403-466","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation"],"prefix":"10.1007","volume":"53","author":[{"given":"Reinder J.","family":"Bril","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Altmeyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martijn M. H. P.","family":"van den Heuvel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert I.","family":"Davis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moris","family":"Behnam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,31]]},"reference":[{"issue":"7","key":"9266_CR1","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1016\/j.sysarc.2010.08.006","volume":"57","author":"S Altmeyer","year":"2011","unstructured":"Altmeyer S, Maiza C (2011) Cache-related preemption delay via useful cache blocks: survey and redefinition. J Syst Archit 57(7):707\u2013719","journal-title":"J Syst Archit"},{"issue":"5","key":"9266_CR2","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/s11241-012-9152-2","volume":"48","author":"S Altmeyer","year":"2012","unstructured":"Altmeyer S, Davis RI, Maiza C (2012) Improved cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems. Real Time Syst 48(5):499\u2013526","journal-title":"Real Time Syst"},{"key":"9266_CR3","unstructured":"Altmeyer S, Douma R, Lunniss W, Davis RI (2014) Evaluation of cache partitioning for hard real-time systems. In: Proceedings of 26th IEEE Euromicro conference on real-time systems (ECRTS), pp 15\u201326, July 2014"},{"key":"9266_CR4","unstructured":"Arnaud A, Puaut I (2006) Dynamic instruction cache locking in hard real-time systems. In: Proceedings of 14th international conference on real-time and network systems (RTNS), pp 179\u2013188, May 2006"},{"key":"9266_CR5","doi-asserted-by":"crossref","unstructured":"Audsley NC, Burns A, Richardson MF, Wellings AJ (1991) Hard real-time scheduling: the deadline monotonic approach. In: Proceedings of 8th IEEE workshop on real-time operating systems and software (RTOSS), pp 133\u2013137, May 1991","DOI":"10.1016\/S1474-6670(17)51283-5"},{"key":"9266_CR6","unstructured":"AUTOSAR\u2014Specification of Operating System (2010) Release 4.1. Technical Report, 2010 (Online). http:\/\/www.autosar.org\/"},{"key":"9266_CR7","doi-asserted-by":"crossref","unstructured":"Baldovin A, Mezzetti E, Vardanega T (2013) Limited preemptive scheduling of non-independent task sets. In: Proceedings of 13th ACM and IEEE international conference on embedded software (EMSOFT), September 2013","DOI":"10.1109\/EMSOFT.2013.6658596"},{"key":"9266_CR8","doi-asserted-by":"crossref","unstructured":"Baruah S (2005) The limited-preemption uniprocessor scheduling of sporadic systems. In: Proceedings of 17th Euromicro conference on real-time systems (ECRTS), pp 137\u2013144, July 2005","DOI":"10.1109\/ECRTS.2005.32"},{"key":"9266_CR9","unstructured":"Bastoni A, Brandenburg B, Anderson J (2010) Cache-related preemption and migration delays: empirical approximation and impact on schedulability. In: Proceedings of 6th international workshop on operating systems platforms for embedded real-time applications (OSPERT), pp 33\u201344, July 2010"},{"key":"9266_CR10","doi-asserted-by":"crossref","unstructured":"Behnam M, Nolte T, Bril RJ (2010) Bounding the number of self-blocking occurrences of SIRAP. In: Proceedings of 31st IEEE real-time systems symposium (RTSS), pp 61\u201372, December 2010","DOI":"10.1109\/RTSS.2010.20"},{"key":"9266_CR11","doi-asserted-by":"crossref","unstructured":"Bertogna M, Fisher N, Baruah S (2007) Static-priority scheduling and resource hold times. In: Proceedings of 15th international workshop on parallel and distributed real-time systems (PDRTS), pp 1\u20138, March 2007","DOI":"10.1109\/IPDPS.2007.370344"},{"key":"9266_CR12","doi-asserted-by":"crossref","unstructured":"Bertogna M, Buttazzo G, Yao G (2011a) Improving feasibility of fixed priority tasks using non-preemptive regions. In: Proceedings of 32nd IEEE real-time systems symposium (RTSS), pp 251\u2013260, December 2011","DOI":"10.1109\/RTSS.2011.30"},{"key":"9266_CR13","doi-asserted-by":"crossref","unstructured":"Bertogna M, Xhani O, Marinoni M, Esposito F, Buttazzo G (2011b) Optimal selection of preemption points to minimize preemption overhead. In: Proceedings of 23rd Euromicro conference on real-time systems (ECRTS), pp 217\u2013227, July 2011","DOI":"10.1109\/ECRTS.2011.28"},{"issue":"1","key":"9266_CR14","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s11241-005-0507-9","volume":"30","author":"E Bini","year":"2005","unstructured":"Bini E, Buttazzo G (2005) Measuring the performance of schedulability tests. Real Time Syst 30(1):129\u2013154","journal-title":"Real Time Syst"},{"key":"9266_CR15","unstructured":"Bril RJ (2004) Real-time scheduling for media processing using conditionally guaranteed budgets. PhD Thesis, TU\/e, The Netherlands, July 2004. http:\/\/alexandria.tue.nl\/extra2\/200412419.pdf"},{"key":"9266_CR16","unstructured":"Bril RJ, Fohler G, Verhaegh WFJ (2008) Execution times and execution jitter of real-time tasks under fixed-priority pre-emptive scheduling. Technical Report CSR 08-27, TU\/e, The Netherlands, October 2008"},{"issue":"1\u20133","key":"9266_CR17","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s11241-009-9071-z","volume":"42","author":"RJ Bril","year":"2009","unstructured":"Bril RJ, Lukkien JJ, Verhaegh WFJ (2009) Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption. Real Time Syst 42(1\u20133):63\u2013119","journal-title":"Real Time Syst"},{"key":"9266_CR18","unstructured":"Bril RJ, van den Heuvel MMHP, Keskin U, Lukkien JJ (2012) Generalized fixed-priority scheduling with preemption thresholds. In: Proceedings of 24th Euromicro conference on real-time systems (ECRTS), pp 209\u2013220, July 2012"},{"key":"9266_CR19","doi-asserted-by":"crossref","unstructured":"Bril RJ, Altmeyer S, van den Heuvel MMHP, Davis RI, Behnam M (2014) Integrating cache-related pre-emption delays into analysis of fixed priority scheduling with pre-emption thresholds. In: Proceedings of 35th IEEE real-time systems symposium (RTSS), pp 161\u2013172, December 2014","DOI":"10.1109\/RTSS.2014.25"},{"key":"9266_CR20","unstructured":"Burgui\u00e8re C, Reineke J, Altmeyer S (2009) Cache-related preemption delay computation for set-associative caches. Pitfalls and solutions. In: Proceedings of 9th workshop on worst-case execution time analysis (WCET), July 2009"},{"key":"9266_CR21","unstructured":"Burns A (1994) Preemptive priority based scheduling: an appropriate engineering approach. In: Son S (ed) Advances in real-time systems. Prentice-Hall, New York, pp 225\u2013248"},{"key":"9266_CR22","doi-asserted-by":"crossref","unstructured":"Busquets-Mataix JV, Serrano JJ, Ors R, Gil P, Wellings A (1996) Adding instruction cache effects to schedulability analysis of preemptive real-time systems. In: Proceedings of 2nd IEEE real-time technology and applications symposium (RTAS), pp 204\u2013212, June 1996","DOI":"10.1109\/RTTAS.1996.509537"},{"issue":"1","key":"9266_CR23","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/TII.2012.2188805","volume":"9","author":"GC Buttazzo","year":"2013","unstructured":"Buttazzo GC, Bertogna M, Yao G (2013) Limited preemptive scheduling for real-time systems: a survey. IEEE Trans Ind Inf 9(1):3\u201315","journal-title":"IEEE Trans Ind Inf"},{"key":"9266_CR24","unstructured":"Campoy AM, Perles Ivars A, Busquets Mataix JV (2001) Static use of locking caches in multitask, preemptive real-time systems. In: Proceedings of IEEE\/IEE real-time embedded systems workshop, December 2001"},{"key":"9266_CR25","doi-asserted-by":"crossref","unstructured":"Campoy AM, Perles Ivars A, Busquets Mataix JV (2002) Dynamic use of locking caches in multitask, preemptive real-time systems. In: Proceedings of 15th international federation of automatic control (IFAC) world congress, July 2002","DOI":"10.3182\/20020721-6-ES-1901.00974"},{"key":"9266_CR26","doi-asserted-by":"crossref","unstructured":"Campoy AM, Perles A, Rodriguez F, Busquets Mataix JV (2003) Static use of locking caches vs. dynamic use of locking caches for real-time systems. In: Proceedings of IEEE Canadian conference on electrical and computer engineering (CCECE), vol 2, pp 1283\u20131284, May 2003","DOI":"10.1109\/CCECE.2003.1226134"},{"key":"9266_CR27","doi-asserted-by":"crossref","unstructured":"Campoy AM, Puaut I, Perles Ivars A, Busquets Mataix JV (2005) Cache contents selection for statically-locked instruction caches: an algorithm comparison. In: Proceedings of 17th IEEE Euromicro conference on real-time systems (ECRTS), pp 49\u201356, July 2005","DOI":"10.1109\/ECRTS.2005.34"},{"key":"9266_CR28","unstructured":"Carbone J (2013) Cutting context switching overhead\u2013reduce overhead through preemption threshold scheduling. In: Newelectronics, pp 29\u201330, September 2013"},{"key":"9266_CR29","doi-asserted-by":"crossref","unstructured":"Cavicchio J, Tessler C, Fisher N (2015) Minimizing cache overhead via loaded cache blocks and preemption placement. In: Proceedings of 27th IEEE Euromicro conference on real-time systems (ECRTS), pp 163\u2013173, July 2015","DOI":"10.1109\/ECRTS.2015.22"},{"key":"9266_CR30","doi-asserted-by":"crossref","unstructured":"Davis RI, Bertogna M (2012) Optimal fixed priority scheduling with deferred pre-emption. In: Proceedings of 33rd IEEE real-time systems symposium (RTSS), pp 39\u201350, December 2012","DOI":"10.1109\/RTSS.2012.57"},{"key":"9266_CR31","unstructured":"Davis RI, Merriam N, Tracey N (2000) How embedded applications using an RTOS can stay within on-chip memory limits. In: Proceedings of WiP and industrial experience sessions Euromicro conference on real-time systems (ECRTS), pp 71\u201377"},{"key":"9266_CR32","doi-asserted-by":"crossref","unstructured":"Ferdinand C, Heckmann R (2004) aiT: worst case execution time prediction by static program analysis. In: Proceedings of IFIP 18th world computer congress, pp 377\u2013384, August 2004","DOI":"10.1007\/978-1-4020-8157-6_29"},{"key":"9266_CR33","doi-asserted-by":"crossref","unstructured":"Gai P, Lipari G, Di Natale M (2001) Minimizing memory utilizations of real-time task sets in single and multi-processor systems-on-a-chip. In: Proceedings of 22nd IEEE real-time systems symposium (RTSS), pp 73\u201383, December 2001","DOI":"10.1109\/REAL.2001.990598"},{"key":"9266_CR34","doi-asserted-by":"crossref","unstructured":"Gebhard G, Altmeyer S (2007) Optimal task placement to improve cache performance. In: Proceedings of 7th ACM & IEEE international conference on embedded software (EMSOFT), pp 259\u2013268, September 2007","DOI":"10.1145\/1289927.1289968"},{"key":"9266_CR35","doi-asserted-by":"crossref","unstructured":"Ghattas R, Dean AG (2007) Preemption threshold scheduling: stack optimality, enhancements and analysis. In: Proceedings of 13th IEEE real-time and embedded technology and applications symposium (RTAS), pp 147\u2013157, April 2007","DOI":"10.1109\/RTAS.2007.27"},{"key":"9266_CR36","unstructured":"Hatvani L, Bril RJ (2015) Schedulability using native non-pre-emptive groups in AUTOSAR\/OSEK platform. In: Proceedings of 20th IEEE international symposium on emerging technologies and factory automation (ETFA), September 2015"},{"issue":"5","key":"9266_CR37","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1093\/comjnl\/29.5.390","volume":"29","author":"M Joseph","year":"1986","unstructured":"Joseph M, Pandya P (1986) Finding response times in a real-time system. Comput J 29(5):390\u2013395","journal-title":"Comput J"},{"key":"9266_CR38","doi-asserted-by":"crossref","unstructured":"Keskin U, Bril RJ, Lukkien JJ (2010) Exact response-time analysis for fixed-priority preemption-threshold scheduling. In: Proceedings of 15th IEEE conference on emerging technologies and factory automation (ETFA), work-in-progress (WiP) session, September 2010","DOI":"10.1109\/ETFA.2010.5640984"},{"key":"9266_CR39","doi-asserted-by":"crossref","unstructured":"Kirk DB (1989) SMART (strategic memory allocation for real-time) cache design. In: Proceedings of 10th IEEE real time systems symposium (RTSS), pp 229\u2013237, December 1989","DOI":"10.1109\/REAL.1989.63574"},{"issue":"4","key":"9266_CR40","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01995674","volume":"2","author":"R Koymans","year":"1990","unstructured":"Koymans R (1990) Specifying real-time properties with metric temporal logic. Real Time Syst 2(4):255\u2013299","journal-title":"Real Time Syst"},{"issue":"6","key":"9266_CR41","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1109\/12.689649","volume":"47","author":"C-G Lee","year":"1998","unstructured":"Lee C-G, Hahn J, Seo Y-M, Min SL, Ha R, Hong S, Park CY, Lee M, Kim CS (1998) Analysis of cache-related preemption delay in fixed-priority preemptive scheduling. IEEE Trans Comput 47(6):700\u2013713","journal-title":"IEEE Trans Comput"},{"key":"9266_CR42","doi-asserted-by":"crossref","unstructured":"Lehoczky JP, Sha L, Ding Y (1989) The rate monotonic scheduling algorithm: exact characterization and average case behavior. In: Proceedings of 10th IEEE real-time systems symposium (RTSS), pp 166\u2013171, December 1989","DOI":"10.1109\/REAL.1989.63567"},{"issue":"1","key":"9266_CR43","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321738.321743","volume":"20","author":"CL Liu","year":"1973","unstructured":"Liu CL, Layland JW (1973) Scheduling algorithms for multiprogramming in a real-time environment. JACM 20(1):46\u201361","journal-title":"JACM"},{"issue":"2","key":"9266_CR44","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/s11241-011-9139-4","volume":"48","author":"T Liu","year":"2012","unstructured":"Liu T, Li M, Xue CJ (2012) Instruction cache locking for multitask real-time embedded systems. Real Time Syst 48(2):166\u2013197","journal-title":"Real Time Syst"},{"key":"9266_CR45","doi-asserted-by":"crossref","unstructured":"Lunniss W, Altmeyer S, Davis RI (2012) Optimising task layout to increase schedulability via reduced cache related pre-emption delays. In: Proceedings of 20th ACM international conference on real-time and network systems (RTNS), pp 161\u2013170, October 2012","DOI":"10.1145\/2392987.2393008"},{"key":"9266_CR46","doi-asserted-by":"crossref","unstructured":"Marinho JM, Nelis V, Petters SM, Puaut I (2012) Preemption delay analysis for floating non-preemptive region scheduling. In: Proceedings of 15th IEEE design, automation and test in Europe conference and exhibition (DATE), pp 497\u2013502, March 2012","DOI":"10.1109\/DATE.2012.6176520"},{"key":"9266_CR47","unstructured":"OSEK\/VDX Operating System (2005) Technical Report, February 2005 (Online). http:\/\/portal.osek-vdx.org\/files\/pdf\/specs\/os223.pdf"},{"key":"9266_CR48","volume-title":"Computer organization and design","author":"DA Patterson","year":"2014","unstructured":"Patterson DA, Hennessy JL (2014) Computer organization and design, 5th edn. Morgan Kaufman, San Francisco","edition":"5"},{"key":"9266_CR49","doi-asserted-by":"crossref","unstructured":"Pellizzoni R, Caccamo M (2007) Toward the predictable integration of real-time COTS based systems. In: Proceedings of 28th IEEE real-time systems symposium (RTSS), pp 73\u201382, December 2007","DOI":"10.1109\/RTSS.2007.15"},{"key":"9266_CR50","doi-asserted-by":"crossref","unstructured":"Puaut I, Decotigny D (2002) Low-complexity algorithms for static cache locking in multitasking hard real-time systems. In: Proceedings of 23rd IEEE real-time systems symposium (RTSS), pp 114\u2013123, December 2002","DOI":"10.1109\/REAL.2002.1181567"},{"key":"9266_CR51","doi-asserted-by":"crossref","unstructured":"Ramaprasad H, Mueller F (2006) Tightening the bounds on feasible preemption points. In: Proceedings of 27th IEEE real-time systems symposium (RTSS), pp 212\u2013224, December 2006","DOI":"10.1109\/RTSS.2006.49"},{"key":"9266_CR52","doi-asserted-by":"crossref","unstructured":"Ramaprasad H, Mueller F (2008) Bounding worst-case response time for tasks with non-preemptive regions. In: Proceedings of 14th IEEE real-time and embedded technology and applications symposium (RTAS), pp 58\u201367, April 2008","DOI":"10.1109\/RTAS.2008.18"},{"key":"9266_CR53","doi-asserted-by":"crossref","unstructured":"Regehr J (2002) Scheduling tasks with mixed preemption relations for robustness to timing faults. In: Proceedings of 23rd IEEE real-time systems symposium (RTSS), pp 315\u2013326, December 2002","DOI":"10.1109\/REAL.2002.1181585"},{"key":"9266_CR54","doi-asserted-by":"crossref","unstructured":"Saksena M, Wang Y (2000) Scalable real-time system design using preemption thresholds. In: Proceedings of 21st IEEE real-time systems symposium (RTSS), pp 25\u201334, December 2000","DOI":"10.1109\/REAL.2000.895993"},{"key":"9266_CR55","doi-asserted-by":"crossref","unstructured":"Staschulat J, Schliecker S, Ernst R (2005) Scheduling analysis of real-time systems with precise modeling of cache related preemption delay. In: Proceedings of 17th IEEE Euromicro conference on real-time systems (ECRTS), pp 41\u201348, July 2005","DOI":"10.1109\/ECRTS.2005.26"},{"key":"9266_CR56","doi-asserted-by":"crossref","unstructured":"Tan T, Mooney V (2007) Timing analysis for preemptive multitasking real-time systems with caches. ACM Trans Embed Comput Syst 6(1):Article 7","DOI":"10.1145\/1210268.1210275"},{"key":"9266_CR57","doi-asserted-by":"crossref","unstructured":"Tomiyama H, Dutt ND (2000) Program path analysis to bound cache-related preemption delay in preemptive real-time systems. In: Proceedings of 8th IEEE international workshop on hardware\/software codesign (CODES), pp 67\u201371, May 2000","DOI":"10.1145\/334012.334025"},{"key":"9266_CR58","unstructured":"Wang Y, Saksena M (1999) Scheduling fixed-priority tasks with preemption threshold. In: Proceedings of 6th IEEE international conference on real-time computing systems and applications (RTCSA), pp 328\u2013335, December 1999"},{"key":"9266_CR59","doi-asserted-by":"crossref","unstructured":"Wang C, Gu Z, Zeng H (2015) Integration of cache partitioning and preemption threshold scheduling to improve schedulability of hard real-time systems. In: Proceedings of 27th IEEE Euromicro conference on real-time systems (ECRTS), pp 69\u201379, July 2015","DOI":"10.1109\/ECRTS.2015.14"},{"key":"9266_CR60","doi-asserted-by":"crossref","unstructured":"Yao G, Buttazzo G, Bertogna M (2009) Bounding the maximum length of non-preemptive regions under fixed-priority scheduling. In: Proceedings of 15th IEEE international conference on embedded and real-time computing systems and applications (RTCSA), pp 351\u2013360, August 2009","DOI":"10.1109\/RTCSA.2009.44"}],"container-title":["Real-Time Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11241-016-9266-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11241-016-9266-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11241-016-9266-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T23:36:47Z","timestamp":1568763407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11241-016-9266-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,31]]},"references-count":60,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["9266"],"URL":"https:\/\/doi.org\/10.1007\/s11241-016-9266-z","relation":{},"ISSN":["0922-6443","1573-1383"],"issn-type":[{"value":"0922-6443","type":"print"},{"value":"1573-1383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,31]]}}}