{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:50:18Z","timestamp":1740124218062,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,1,18]],"date-time":"2021-01-18T00:00:00Z","timestamp":1610928000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,18]],"date-time":"2021-01-18T00:00:00Z","timestamp":1610928000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS 1409175","CPS 1446631"],"award-info":[{"award-number":["CNS 1409175","CPS 1446631"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS 1563845","and CNS 1717589"],"award-info":[{"award-number":["CNS 1563845","and CNS 1717589"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-17-1-0294"],"award-info":[{"award-number":["W911NF-17-1-0294"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"name":"General Motors"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Real-Time Syst"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s11241-020-09360-1","type":"journal-article","created":{"date-parts":[[2021,1,18]],"date-time":"2021-01-18T11:14:29Z","timestamp":1610968469000},"page":"4-54","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tardiness bounds for fixed-priority global scheduling without intra-task precedence constraints"],"prefix":"10.1007","volume":"57","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8153-6098","authenticated-orcid":false,"given":"Sergey","family":"Voronov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James H.","family":"Anderson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kecheng","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,18]]},"reference":[{"key":"9360_CR2","unstructured":"Audsley N (1991) Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. Citeseer"},{"key":"9360_CR3","unstructured":"Baker T (2005) Comparison of empirical success rates of global vs. partitioned fixed-priority and EDF scheduling for hard real time. Tech. Rep. TR-050601, Department of Computer Science, Florida State University"},{"issue":"1","key":"9360_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s11241-009-9075-8","volume":"43","author":"T Baker","year":"2009","unstructured":"Baker T, Baruah S (2009) An analysis of global EDF schedulability for arbitrary-deadline sporadic task systems. Real Time Syst 43(1):3\u201324","journal-title":"Real Time Syst"},{"issue":"3","key":"9360_CR5","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s11241-007-9047-9","volume":"38","author":"S Baruah","year":"2008","unstructured":"Baruah S, Baker T (2008) Schedulability analysis of global EDF. Real Time Syst 38(3):223\u2013235","journal-title":"Real Time Syst"},{"key":"9360_CR6","doi-asserted-by":"crossref","unstructured":"Baruah S, Fisher N (2008) Global fixed-priority scheduling of arbitrary-deadline sporadic task systems. In: Proceedings of the 9th international conference on distributed computing and networking, pp 215\u2013226","DOI":"10.1007\/978-3-540-77444-0_20"},{"key":"9360_CR7","doi-asserted-by":"crossref","unstructured":"Bertogna M, Cirinei M, Lipari G (2005) Improved schedulability analysis of EDF on multiprocessor platforms. In: Proceedings of the 17th Euromicro conference on real-time systems, pp 209\u2013218","DOI":"10.1109\/ECRTS.2005.18"},{"key":"9360_CR8","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s11241-016-9266-z","volume":"53","author":"R Bril","year":"2017","unstructured":"Bril R, Altmeyer S, van den Heuvel M, Davis R, Behnam M (2017) Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation. Real Time Syst 53:403\u2013466","journal-title":"Real Time Syst"},{"key":"9360_CR9","unstructured":"Davis R, Burns A (2009) Priority assignment for global fixed-priority preemptive scheduling in multiprocessor real-time systems. In: Proceedings of the 30th IEEE real-time systems symposium, pp 398\u2013409"},{"issue":"1","key":"9360_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11241-010-9106-5","volume":"47","author":"R Davis","year":"2011","unstructured":"Davis R, Burns A (2011) Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems. Real Time Syst 47(1):1\u201340","journal-title":"Real Time Syst"},{"key":"9360_CR11","unstructured":"Devi U (2006) Soft real-time scheduling on multiprocessors. Ph.D. thesis, University of North Carolina at Chapel Hill"},{"key":"9360_CR12","doi-asserted-by":"crossref","unstructured":"Devi U, Anderson J (2005) Tardiness bounds for global EDF scheduling on a multiprocessor. In: Proceedings of the 26th IEEE real-time systems symposium, pp 330\u2013341","DOI":"10.1109\/RTSS.2005.39"},{"issue":"2","key":"9360_CR13","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s11241-007-9042-1","volume":"38","author":"U Devi","year":"2008","unstructured":"Devi U, Anderson J (2008) Tardiness bounds under global EDF scheduling on a multiprocessor. Real Time Syst 38(2):133\u2013189","journal-title":"Real Time Syst"},{"key":"9360_CR14","doi-asserted-by":"crossref","unstructured":"Erickson J, Anderson J (2011) Response time bounds for G-EDF without intra-task precedence constraints. In: Proceedings of the 15th international conference on principles of distributed systems, pp 128\u2013142","DOI":"10.1007\/978-3-642-25873-2_10"},{"key":"9360_CR15","unstructured":"Express Logic Inc.: Threadx (2019). https:\/\/rtos.com\/solutions\/threadx\/real-time-operating-system\/"},{"key":"9360_CR16","doi-asserted-by":"crossref","unstructured":"Gai P, Lipari G, Di Natale M (2001) Minimizing memory utilization of real-time task sets in single and multi-processor systems-on-a-chip. In: Proceedings of the 22nd IEEE real-time systems symposium, pp 73\u201383","DOI":"10.1109\/REAL.2001.990598"},{"key":"9360_CR17","doi-asserted-by":"crossref","unstructured":"Ghattas R, Dean A (2007) Preemption threshold scheduling: Stack optimality, enhancements and analysis. In: Proceedings of the 13th IEEE real time and embedded technology and applications symposium, pp 147\u2013157","DOI":"10.1109\/RTAS.2007.27"},{"key":"9360_CR18","doi-asserted-by":"crossref","unstructured":"Keskin U, Bril R, Lukkien J (2010) Exact response-time analysis for fixed-priority preemption-threshold scheduling. In: Proceedings of the 15th IEEE conference on emerging technologies & factory automation, pp 1\u20134. IEEE","DOI":"10.1109\/ETFA.2010.5640984"},{"key":"9360_CR19","doi-asserted-by":"crossref","unstructured":"Leontyev H, Anderson J (2007) Tardiness bounds for EDF scheduling on multi-speed multicore platforms. In: Proceedings of the 13th IEEE international conference on embedded and real-time computing systems and applications, pp 103\u2013110","DOI":"10.1109\/RTCSA.2007.68"},{"issue":"1\u20134","key":"9360_CR20","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01553887","volume":"4","author":"J Leung","year":"1989","unstructured":"Leung J (1989) A new algorithm for scheduling periodic, real-time tasks. Algorithmica 4(1\u20134):209","journal-title":"Algorithmica"},{"issue":"3","key":"9360_CR21","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0020-0190(80)90123-4","volume":"11","author":"J Leung","year":"1980","unstructured":"Leung J, Merrill M (1980) A note on preemptive scheduling of periodic, real-time tasks. Inf Process Lett 11(3):115\u2013118","journal-title":"Inf Process Lett"},{"issue":"4","key":"9360_CR22","doi-asserted-by":"publisher","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"},{"issue":"3","key":"9360_CR23","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/0377-2217(95)00332-0","volume":"96","author":"C Li","year":"1997","unstructured":"Li C, Lee C (1997) Scheduling with agreeable release times and due dates on a batch processing machine. Eur J Oper Res 96(3):564\u2013569","journal-title":"Eur J Oper Res"},{"key":"9360_CR24","doi-asserted-by":"crossref","unstructured":"Regehr J (2002) Scheduling tasks with mixed preemption relations for robustness to timing faults. In: Proceedings of the 23rd IEEE real-time systems symposium, pp 315\u2013326","DOI":"10.1109\/REAL.2002.1181585"},{"key":"9360_CR25","unstructured":"Saksena M, Wang Y (2000) Scalable real-time system design using preemption thresholds. In: Proceedings 21st IEEE real-time systems symposium, pp 25\u201334. IEEE"},{"issue":"7","key":"9360_CR26","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1080\/00207549408957026","volume":"32","author":"R Uzsoy","year":"1994","unstructured":"Uzsoy R (1994) Scheduling a single batch processing machine with non-identical job sizes. Int J Prod Res 32(7):1615\u20131635","journal-title":"Int J Prod Res"},{"key":"9360_CR27","doi-asserted-by":"crossref","unstructured":"Voronov S, Anderson J, Yang K (2018) Tardiness bounds for fixed-priority global scheduling without intra-task precedence constraints. In: Proceedings of the 26th international conference on real-time networks and systems, pp 8\u201318","DOI":"10.1145\/3273905.3273913"},{"key":"9360_CR28","unstructured":"Wang Y, Saksena M (1999) Scheduling fixed-priority tasks with preemption threshold. In: Proceedings of sixth international conference on real-time computing systems and applications (RTCSA\u201999) (Cat. No. PR00306), pp 328\u2013335. IEEE"},{"key":"9360_CR29","doi-asserted-by":"crossref","unstructured":"Yang K, Anderson J (2014) Optimal GEDF-based schedulers that allow intra-task parallelism on heterogeneous multiprocessors. In: Proceedings of the 12th IEEE symposium on embedded systems for real-time multimedia, pp 30\u201339","DOI":"10.1109\/ESTIMedia.2014.6962343"},{"key":"9360_CR30","doi-asserted-by":"crossref","unstructured":"Yang K, Yang M, Anderson J (2016) Reducing response-time bounds for DAG-based task systems on heterogeneous multicore platforms. In: Proceedings of the 24th international conference on real-time networks and systems, pp 349\u2013358","DOI":"10.1145\/2997465.2997486"},{"key":"9360_CR31","doi-asserted-by":"crossref","unstructured":"Yang M, Amert T, Yang K, Otterness N, Anderson J, Smith F, Wang S (2018) Making OpenVX really \u2018real time\u2019. In: Proceedings of the 39th IEEE real-time systems symposium, pp 80\u201393","DOI":"10.1109\/RTSS.2018.00018"}],"container-title":["Real-Time Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11241-020-09360-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11241-020-09360-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11241-020-09360-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,21]],"date-time":"2021-03-21T15:05:56Z","timestamp":1616339156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11241-020-09360-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,18]]},"references-count":30,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["9360"],"URL":"https:\/\/doi.org\/10.1007\/s11241-020-09360-1","relation":{},"ISSN":["0922-6443","1573-1383"],"issn-type":[{"type":"print","value":"0922-6443"},{"type":"electronic","value":"1573-1383"}],"subject":[],"published":{"date-parts":[[2021,1,18]]},"assertion":[{"value":"24 November 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}