{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T16:55:47Z","timestamp":1686156947839},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T00:00:00Z","timestamp":1294963200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Real-Time Syst"],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1007\/s11241-010-9113-6","type":"journal-article","created":{"date-parts":[[2011,1,13]],"date-time":"2011-01-13T18:48:03Z","timestamp":1294944483000},"page":"198-223","source":"Crossref","is-referenced-by-count":24,"title":["Feasibility analysis under fixed priority scheduling with\u00a0limited preemptions"],"prefix":"10.1007","volume":"47","author":[{"given":"Gang","family":"Yao","sequence":"first","affiliation":[]},{"given":"Giorgio","family":"Buttazzo","sequence":"additional","affiliation":[]},{"given":"Marko","family":"Bertogna","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,1,14]]},"reference":[{"key":"9113_CR1","first-page":"105","volume-title":"8th int. workshop on worst-case execution time analysis","author":"S Altmeyer","year":"2008","unstructured":"Altmeyer S, Gebhard G (2008) Wcet analysis for preemptive scheduling. In: 8th int. workshop on worst-case execution time analysis, Prague, Czech, pp 105\u2013112"},{"issue":"1","key":"9113_CR2","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF00365393","volume":"3","author":"TP Baker","year":"1991","unstructured":"Baker TP (1991) Stack-based scheduling of real-time processes. Real-Time Syst 3(1):67\u2013100","journal-title":"Real-Time Syst"},{"key":"9113_CR3","first-page":"137","volume-title":"ECRTS \u201905: proc. of Euromicro conf. on real-time systems","author":"S Baruah","year":"2005","unstructured":"Baruah S (2005) The limited-preemption uniprocessor scheduling of sporadic systems. In: ECRTS \u201905: proc. of Euromicro conf. on real-time systems, pp 137\u2013144"},{"key":"9113_CR4","volume-title":"Proceedings of 22nd Euromicro conference on real-time systems (ECRTS\u201910)","author":"M Bertogna","year":"2010","unstructured":"Bertogna M, Buttazzo G, Marinoni M, Yao G, Esposito F, Caccamo M (2010) Preemption points placement for sporadic task sets. In: Proceedings of 22nd Euromicro conference on real-time systems (ECRTS\u201910), Bruxelles, Belgium"},{"issue":"11","key":"9113_CR5","doi-asserted-by":"crossref","first-page":"1462","DOI":"10.1109\/TC.2004.103","volume":"53","author":"E Bini","year":"2004","unstructured":"Bini E, Buttazzo GC (2004) Schedulability analysis of periodic fixed priority systems. IEEE Trans Comput 53(11):1462\u20131473","journal-title":"IEEE Trans Comput"},{"issue":"1\u20132","key":"9113_CR6","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 GC (2005) Measuring the performance of schedulability tests. Real-Time Syst 30(1\u20132):129\u2013154","journal-title":"Real-Time Syst"},{"key":"9113_CR7","unstructured":"Bril R (2004) Specification and compositional verification of real-time systems. PhD thesis, Technische Universiteit Eindhoven (TU\/e)"},{"issue":"1\u20133","key":"9113_CR8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s11241-009-9071-z","volume":"42","author":"R Bril","year":"2009","unstructured":"Bril R, Lukkien J, Verhaegh W (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":"9113_CR9","first-page":"269","volume-title":"ECRTS \u201907: proc. of Euromicro conf. on real-time systems","author":"RJ Bril","year":"2007","unstructured":"Bril RJ, Lukkien JJ, Verhaegh WFJ (2007) Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred revisited. In: ECRTS \u201907: proc. of Euromicro conf. on real-time systems, pp 269\u2013279"},{"key":"9113_CR10","first-page":"225","volume-title":"Advances in real-time systems","author":"A Burns","year":"1994","unstructured":"Burns A (1994) Preemptive priority based scheduling: an appropriate engineering approach. In: Son S (ed) Advances in real-time systems, pp 225\u2013248"},{"key":"9113_CR11","volume-title":"Real-time systems and programming languages: ADA, real-time Java and C\/real-time POSIX","author":"A Burns","year":"2009","unstructured":"Burns A, Wellings A (2009) In: Real-time systems and programming languages: ADA, real-time Java and C\/real-time POSIX (44th edn.). Addison-Wesley, Reading","edition":"44"},{"issue":"3","key":"9113_CR12","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s11241-007-9012-7","volume":"35","author":"RI Davis","year":"2007","unstructured":"Davis RI, Burns A, Bril RJ, Lukkien JJ (2007) Controller area network (CAN) schedulability analysis: refuted, revisited and revised. Real-Time Syst 35(3):239\u2013272","journal-title":"Real-Time Syst"},{"issue":"4","key":"9113_CR13","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(83)90117-5","volume":"16","author":"G Frederickson","year":"1983","unstructured":"Frederickson G (1983) Scheduling unit-time tasks with integer release times and deadlines. Inf Process Lett 16(4):171\u2013173","journal-title":"Inf Process Lett"},{"issue":"2","key":"9113_CR14","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1137\/0210018","volume":"10","author":"M Garey","year":"1981","unstructured":"Garey M, Johnson D, Simons B, Tarjan R (1981) Scheduling unit-time tasks with arbitrary release times and deadlines. SIAM J Comput 10(2):256\u2013269","journal-title":"SIAM J Comput"},{"key":"9113_CR15","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1145\/1289927.1289968","volume-title":"Proc. of the ACM-IEEE int. conf. on embedded software","author":"G Gebhard","year":"2007","unstructured":"Gebhard G, Altmeyer S (2007) Optimal task placement to improve cache performance. In: Proc. of the ACM-IEEE int. conf. on embedded software, Salzburg, Austria, pp 259\u2013268"},{"key":"9113_CR16","unstructured":"George L, Rivierre N, Spuri M (1996) Preemptive and non-preemptive real-time uniprocessor scheduling. Research report RR-2966, INRIA, France"},{"key":"9113_CR17","first-page":"129","volume-title":"Proc. of real-time systems symposium","author":"K Jeffay","year":"1991","unstructured":"Jeffay K, Stanat D, Martel C (1991) On non-preemptive scheduling of period and sporadic tasks. In: Proc. of real-time systems symposium, pp 129\u2013139"},{"issue":"1","key":"9113_CR18","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0020-0190(81)90066-1","volume":"12","author":"E Lawler","year":"1981","unstructured":"Lawler E, Martel C (1981) Scheduling periodically occurring tasks on multiple processors. Inf Process Lett 12(1):9\u201312","journal-title":"Inf Process Lett"},{"issue":"6","key":"9113_CR19","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":"9113_CR20","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1109\/REAL.1989.63567","volume-title":"Proc. of the real-time systems symposium","author":"J Lehoczky","year":"1989","unstructured":"Lehoczky J, Sha L, Ding Y (1989) The rate monotonic scheduling algorithm: exact characterization and average case behavior. In: Proc. of the real-time systems symposium, CA, USA, pp 166\u2013171"},{"issue":"4","key":"9113_CR21","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0166-5316(82)90024-4","volume":"2","author":"J Leung","year":"1982","unstructured":"Leung J, Whitehead J (1982) On the complexity of fixed-priority scheduling of periodic real-time tasks. Perform Eval 2(4):237\u2013250","journal-title":"Perform Eval"},{"key":"9113_CR22","volume-title":"Proc. of workshop on experimental computer science","author":"C Li","year":"2007","unstructured":"Li C, Ding C, Shen K (2007) Quantifying the cost of context switch. In: Proc. of workshop on experimental computer science, San Diego, California"},{"issue":"1","key":"9113_CR23","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 hard-real-time environment. J ACM 20(1):46\u201361","journal-title":"J ACM"},{"key":"9113_CR24","unstructured":"Mok A-L (1983) Fundamental design problems of distributed systems for the hard real-time environment. PhD thesis, MIT, USA"},{"key":"9113_CR25","first-page":"212","volume-title":"RTSS \u201906. proc. of 27th real-time systems symposium","author":"H Ramaprasad","year":"2006","unstructured":"Ramaprasad H, Mueller F (2006) Tightening the bounds on feasible preemption points. In: RTSS \u201906. proc. of 27th real-time systems symposium, pp 212\u2013222"},{"key":"9113_CR26","first-page":"315","volume-title":"Proc. of the 23rd IEEE real-time systems symposium","author":"J Regehr","year":"2002","unstructured":"Regehr J (2002) Scheduling tasks with mixed preemption relations for robustness to timing faults. In: Proc. of the 23rd IEEE real-time systems symposium, pp 315\u2013326"},{"issue":"9","key":"9113_CR27","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1109\/12.57058","volume":"39","author":"L Sha","year":"1990","unstructured":"Sha L, Rajkumar R, Lehoczky JP (1990) Priority inheritance protocols: an approach to real-time synchronization. IEEE Trans Comput 39(9):1175\u20131185","journal-title":"IEEE Trans Comput"},{"issue":"3","key":"9113_CR28","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/52.88945","volume":"8","author":"JA Stankovic","year":"1991","unstructured":"Stankovic JA, Ramamritham K (1991) The spring kernel: a new paradigm for real-time systems. IEEE Softw 8(3):62\u201372","journal-title":"IEEE Softw"},{"key":"9113_CR29","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1145\/1017753.1017798","volume-title":"Proc. of ACM int. conf. on embedded software","author":"J Staschulat","year":"2004","unstructured":"Staschulat J, Ernst R (2004) Multiple process execution in cache related preemption delay analysis. In: Proc. of ACM int. conf. on embedded software, Pisa, Italy, pp 278\u2013286"},{"key":"9113_CR30","first-page":"328","volume-title":"Proc. of conf. on embedded and real-time computing systems and applications","author":"Y Wang","year":"1999","unstructured":"Wang Y, Saksena M (1999) Scheduling fixed-priority tasks with preemption threshold. In: Proc. of conf. on embedded and real-time computing systems and applications, pp 328\u2013335"},{"key":"9113_CR31","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1109\/RTCSA.2009.44","volume-title":"Proceedings of the 16th IEEE international conference on embedded and real-time computing systems and applications (RTCSA 2009)","author":"G Yao","year":"2009","unstructured":"Yao G, Buttazzo G, Bertogna M (2009) Bounding the maximum length of non-preemptive regions under fixed priority scheduling. In: Proceedings of the 16th IEEE international conference on embedded and real-time computing systems and applications (RTCSA 2009), Beijing, China, August 24\u201326, 2009, pp 351\u2013360"},{"key":"9113_CR32","volume-title":"Proceedings of the 15th IEEE international conference on emerging technology and factory automation (ETFA10)","author":"G Yao","year":"2010","unstructured":"Yao G, Buttazzo G, Bertogna M (2010) Comparative evaluation of limited preemptive methods. In: Proceedings of the 15th IEEE international conference on emerging technology and factory automation (ETFA10), Bilbao, Spain, September 13\u201316, 2010."},{"key":"9113_CR33","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1109\/RTCSA.2010.40","volume-title":"Proceedings of the 16th IEEE international conference on embedded and real-time computing systems and applications (RTCSA 2010)","author":"G Yao","year":"2010","unstructured":"Yao G, Buttazzo G, Bertogna M (2010) Feasibility analysis under fixed priority scheduling with fixed preemption points. In: Proceedings of the 16th IEEE international conference on embedded and real-time computing systems and applications (RTCSA 2010), Macao, China, August 23\u201325, 2010, pp\u00a071\u201380"}],"container-title":["Real-Time Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11241-010-9113-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11241-010-9113-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11241-010-9113-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T11:09:53Z","timestamp":1559387393000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11241-010-9113-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,14]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["9113"],"URL":"https:\/\/doi.org\/10.1007\/s11241-010-9113-6","relation":{},"ISSN":["0922-6443","1573-1383"],"issn-type":[{"value":"0922-6443","type":"print"},{"value":"1573-1383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,14]]}}}