{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:57:04Z","timestamp":1771037824919,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2015,7,30]],"date-time":"2015-07-30T00:00:00Z","timestamp":1438214400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000266","name":"FN:Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["GN:ID0EVOAG13"],"award-info":[{"award-number":["GN:ID0EVOAG13"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"FN:Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["GN:ID0E2PAG14"],"award-info":[{"award-number":["GN:ID0E2PAG14"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Real-Time Syst"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s11241-015-9233-0","type":"journal-article","created":{"date-parts":[[2015,7,29]],"date-time":"2015-07-29T07:21:43Z","timestamp":1438154503000},"page":"566-601","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms"],"prefix":"10.1007","volume":"51","author":[{"given":"Robert I.","family":"Davis","sequence":"first","affiliation":[]},{"given":"Alan","family":"Burns","sequence":"additional","affiliation":[]},{"given":"Sanjoy","family":"Baruah","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Rothvo\u00df","sequence":"additional","affiliation":[]},{"given":"Laurent","family":"George","sequence":"additional","affiliation":[]},{"given":"Oliver","family":"Gettings","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,30]]},"reference":[{"key":"9233_CR1","unstructured":"Audsley NC (1991) Optimal priority assignment and feasibility of static priority tasks with arbitrary start times, Technical Report YCS 164. Department of Computer Science, University of York, UK"},{"issue":"1","key":"9233_CR2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0020-0190(00)00165-4","volume":"79","author":"NC Audsley","year":"2001","unstructured":"Audsley NC (2001) On priority assignment in fixed priority scheduling. Inf Process Lett 79(1):39\u201344","journal-title":"Inf Process Lett"},{"issue":"5","key":"9233_CR3","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1049\/sej.1993.0034","volume":"8","author":"NC Audsley","year":"1993","unstructured":"Audsley NC, Burns A, Richardson M, Wellings AJ (1993) Applying new scheduling theory to static priority pre-emptive scheduling. Softw Eng J 8(5):284\u2013292","journal-title":"Softw Eng J"},{"key":"9233_CR4","doi-asserted-by":"crossref","unstructured":"Baker TP (1991) Stack-based scheduling of real-time processes. Real-Time Syst J 3(1):67\u2013100","DOI":"10.1007\/BF00365393"},{"key":"9233_CR5","doi-asserted-by":"crossref","unstructured":"Baruah SK (2006) Resource sharing in edf-scheduled systems: a closer look. In:Proceedings real-time systems symposium (RTSS), pp 379\u2013387","DOI":"10.1109\/RTSS.2006.41"},{"key":"9233_CR6","doi-asserted-by":"crossref","unstructured":"Baruah SK, Mok AK, Rosier LE (1990a) Preemptively scheduling hard-real-time sporadic tasks on one processor. In: Proceedings real-time systems symposium (RTSS), pp 182\u2013190","DOI":"10.1109\/REAL.1990.128746"},{"issue":"4","key":"9233_CR7","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01995675","volume":"2","author":"SK Baruah","year":"1990","unstructured":"Baruah SK, Rosier LE, Howell RR (1990b) Algorithms and complexity concerning the preemptive scheduling of periodic real-time tasks on one processor. Real-Time Syst 2(4):301\u2013324","journal-title":"Real-Time Syst"},{"issue":"1\u20132","key":"9233_CR8","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"},{"issue":"3","key":"9233_CR9","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.ipl.2006.03.002","volume":"99","author":"K Bletsas","year":"2006","unstructured":"Bletsas K, Audsley N (2006) Optimal priority assignment in the presence of blocking information processing letters 99(3):83\u201386","journal-title":"Optimal priority assignment in the presence of blocking information processing letters"},{"issue":"1\u20133","key":"9233_CR10","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 WF (2009) Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred pre-emption. Real-Time Syst 42(1\u20133):63\u2013119","journal-title":"Real-Time Syst"},{"issue":"5","key":"9233_CR11","doi-asserted-by":"crossref","first-page":"1241","DOI":"10.1109\/TC.2014.2322619","volume":"64","author":"A Burns","year":"2015","unstructured":"Burns A, Gutierrez M, Aldea Rivas M, Gonzalez Harbour M (2015) A deadline-floor inheritance protocol for EDF scheduled embedded real-time systems with resource sharing. Comput, IEEE Trans on 64(5):1241\u20131253. doi: 10.1109\/TC.2014.2322619","journal-title":"Comput, IEEE Trans on"},{"key":"9233_CR12","unstructured":"Davis RI, George L, Courbin P (2010) Quantifying the sub-optimality of uniprocessor fixed priority non-pre-emptive scheduling. In: Proceedings of real-time and network systems (RTNS), pp 1\u201310"},{"key":"9233_CR13","doi-asserted-by":"crossref","unstructured":"Davis RI, Rothvo\u00df T, Baruah SK, Burns A (2009a) Quantifying the sub-optimality of uniprocessor fixed priority pre-emptive scheduling for sporadic task sets with arbitrary deadlines. In: Proceedings of real-time and network systems (RTNS), pp 23\u201331","DOI":"10.1007\/s11241-009-9079-4"},{"issue":"3","key":"9233_CR14","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s11241-009-9079-4","volume":"43","author":"RI Davis","year":"2009","unstructured":"Davis RI, Rothvo\u00df T, Baruah SK, Burns A (2009b) Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling. Real-Time Syst 43(3):211\u2013258","journal-title":"Real-Time Syst"},{"key":"9233_CR15","unstructured":"Dertouzos ML (1974) Control robotics: the procedural control of physical processes. In: Proceedings of the IFIP congress, pp 807\u2013813"},{"key":"9233_CR16","doi-asserted-by":"crossref","unstructured":"George L, Hermant J (2009) A norm approach for the partitioned EDF scheduling of sporadic task systems. In: Proceeding euromicro conference on real-time systems (ECRTS)","DOI":"10.1109\/ECRTS.2009.29"},{"key":"9233_CR17","unstructured":"George L, Muhlethaler P, Rivierre N (1995) Optimality and non-preemptive real-time scheduling revisited. Rapport de Recherche RR-2516. INRIA, Le Chesnay Cedex, France"},{"key":"9233_CR18","unstructured":"George L, Rivierre N, Spuri M (1996) Preemptive and non-preemptive real-time uniprocessor scheduling. INRIA Research Report, No. 2966"},{"key":"9233_CR19","doi-asserted-by":"crossref","unstructured":"Howell RR, Venkatrao MK (1995) On non-preemptive scheduling of recurring tasks using inserted idle time. Inf Comput J 117(1)","DOI":"10.1006\/inco.1995.1028"},{"key":"9233_CR20","unstructured":"Jeffay K, Stanat DF, Martel CU (1991) On non-preemptive scheduling of periodic and sporadic tasks. In: Proceedings real-time systems symposium (RTSS), pp 129\u2013139"},{"issue":"5","key":"9233_CR21","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 PK (1986) Finding response times in a real-time system. Comput J 29(5):390\u2013395","journal-title":"Comput J"},{"key":"9233_CR22","unstructured":"Kalyanasundaram B, Pruhs K (1995) Speed is as powerful as clairvoyance. In: Proceedings of symposium on foundations of computer science, pp 214\u2013221"},{"key":"9233_CR23","doi-asserted-by":"crossref","unstructured":"Kim N (1980) Prevention of task overruns in real-time non-preemptive multiprogramming systems. In: Proceedings of Perf., Assoc. Comp. Mach., pp 267\u2013276","DOI":"10.1145\/800199.806173"},{"key":"9233_CR24","doi-asserted-by":"crossref","unstructured":"Lehoczky J (1990) Fixed priority scheduling of periodic task sets with arbitrary deadlines. In: Proceedings real-time systems symposium (RTSS), pp 201\u2013209","DOI":"10.1109\/REAL.1990.128748"},{"key":"9233_CR25","doi-asserted-by":"crossref","unstructured":"Lehoczky JP, Sha L, Ding Y (1989) The rate monotonic scheduling algorithm: exact characterization and average case behaviour. In: Proceedings real-time systems symposium (RTSS), pp 166\u2013171","DOI":"10.1109\/REAL.1989.63567"},{"issue":"4","key":"9233_CR26","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0166-5316(82)90024-4","volume":"2","author":"JY-T Leung","year":"1982","unstructured":"Leung JY-T, 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"},{"issue":"1","key":"9233_CR27","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":"9233_CR28","unstructured":"Mok AK (1983) Fundamental design problems of distributed systems for the hard-real-time environment, Ph.D. Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge"},{"issue":"9","key":"9233_CR29","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 J (1990) Priority inheritance protocols: an approach to real-time synchronisation. IEEE Trans Comput 39(9):1175\u20131185","journal-title":"IEEE Trans Comput"},{"key":"9233_CR30","unstructured":"Spuri M (1996) Analysis of deadline scheduled real-time systems. INRIA Technical, Report No 2772"},{"key":"9233_CR31","doi-asserted-by":"crossref","unstructured":"Thekkilakattil A, Dobrin R, Punnekkat S (2013) Quantifying the sub-optimality of non-preemptive real-time scheduling. In: Proceedings of euromicro conference on real-time systems (ECRTS), pp 113, 122","DOI":"10.1109\/ECRTS.2013.22"},{"issue":"2","key":"9233_CR32","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01088593","volume":"6","author":"KW Tindell","year":"1994","unstructured":"Tindell KW, Burns A, Wellings AJ (1994) An extendible approach for analyzing fixed priority hard real-time tasks. Real-Time Syst 6(2):133\u2013151","journal-title":"Real-Time Syst"},{"key":"9233_CR33","doi-asserted-by":"crossref","unstructured":"von der Br\u00fcggen G, Chen JJ, Huang W-H (2015) Schedulability and optimization analysis for non-preemptive static priority scheduling based on task utilization and blocking factors. In: Proceedings of euromicro conference on real-time systems (ECRTS), pp 90\u2013101","DOI":"10.1109\/ECRTS.2015.16"},{"issue":"9","key":"9233_CR34","doi-asserted-by":"crossref","first-page":"1250","DOI":"10.1109\/TC.2009.58","volume":"58","author":"F Zhang","year":"2009","unstructured":"Zhang F, Burns A (2009) Schedulability analysis for real-time systems with edf scheduling. Comput, IEEE Trans on 58(9):1250\u20131258. doi: 10.1109\/TC.2009.58","journal-title":"Comput, IEEE Trans on"},{"key":"9233_CR35","unstructured":"Zhang F, Burns A (2011) Schedulability analysis of EDF scheduled embedded real-time systems with resource sharing. ACM Trans Embed Comput Syst 9, 4, Article 39"}],"container-title":["Real-Time Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11241-015-9233-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11241-015-9233-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11241-015-9233-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T17:12:55Z","timestamp":1567012375000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11241-015-9233-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,30]]},"references-count":35,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["9233"],"URL":"https:\/\/doi.org\/10.1007\/s11241-015-9233-0","relation":{},"ISSN":["0922-6443","1573-1383"],"issn-type":[{"value":"0922-6443","type":"print"},{"value":"1573-1383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,30]]}}}