{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:50:12Z","timestamp":1740124212382,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,9,25]],"date-time":"2015-09-25T00:00:00Z","timestamp":1443139200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council (GB)","doi-asserted-by":"publisher","award":["EP\/K011626\/1"],"award-info":[{"award-number":["EP\/K011626\/1"]}],"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":[[2016,1]]},"DOI":"10.1007\/s11241-015-9241-0","type":"journal-article","created":{"date-parts":[[2015,9,25]],"date-time":"2015-09-25T07:20:58Z","timestamp":1443165658000},"page":"113-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley\u2019s optimal priority assignment algorithm"],"prefix":"10.1007","volume":"52","author":[{"given":"Robert I.","family":"Davis","sequence":"first","affiliation":[]},{"given":"Marko","family":"Bertogna","sequence":"additional","affiliation":[]},{"given":"Vincenzo","family":"Bonifaci","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,9,25]]},"reference":[{"key":"9241_CR1","unstructured":"Andersson B, Jonsson J (2000) Some insights on fixed-priority pre-emptive non-partitioned multiprocessor scheduling. In: Proceedings real-time systems symposium (RTSS)\u2014work-in-progress session"},{"key":"9241_CR2","unstructured":"Audsley NC (1991) Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. Technical report YCS 164. Deptartment of Computer Science, University of York, UK"},{"issue":"1","key":"9241_CR3","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"},{"key":"9241_CR4","doi-asserted-by":"crossref","unstructured":"Baker TP, Cirinei M (2007) Brute-force determination of multiprocessor schedulability for sets of sporadic hard-deadline tasks. In: Proceedings of the 11th international conference on principles of distributed systems (OPODIS). Lecture Notes in Computer Science (LNCS), vol 4878. Springer, Berlin, Heidelberg, p 62\u201375","DOI":"10.1007\/978-3-540-77096-1_5"},{"issue":"4","key":"9241_CR5","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1007\/s00453-011-9505-6","volume":"63","author":"V Bonifaci","year":"2012","unstructured":"Bonifaci V, Marchetti-Spaccamela A (2012) Feasibility analysis of sporadic real-time multiprocessor task systems. Algorithmica 63(4):763\u2013780","journal-title":"Algorithmica"},{"key":"9241_CR6","doi-asserted-by":"crossref","unstructured":"Cucu L, Goossens J (2006) Feasibility intervals for fixed-priority real-time scheduling on uniform multiprocessors. In: Proceedings emerging technologies and factory automation (ETFA), p 397\u2013405","DOI":"10.1109\/ETFA.2006.355388"},{"key":"9241_CR7","doi-asserted-by":"crossref","unstructured":"Cucu L, Goossens J (2007) Feasibility intervals for multiprocessor fixed-priority scheduling of arbitrary deadline periodic systems. In: Proceedings design automation and test in Europe (DATE), p 1635\u20131640","DOI":"10.1109\/DATE.2007.364536"},{"key":"9241_CR8","unstructured":"Bertogna M, Cirinei M (2007) Response time analysis for global scheduled symmetric multiprocessor platforms. In: Proceedings real-time systems symposium (RTSS), p 149\u2013158"},{"issue":"4","key":"9241_CR9","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1109\/TPDS.2008.129","volume":"20","author":"M Bertogna","year":"2009","unstructured":"Bertogna M, Cirinei M, Lipari G (2009) Schedulability analysis of global scheduling algorithms on multiprocessor platforms. IEEE Trans Parallel Distrib Syst 20(4):553\u2013566","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"9241_CR10","doi-asserted-by":"crossref","unstructured":"Davis RI, Burns A (2009) Priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems. In: Proceedings 30th IEEE real-time systems symposium (RTSS\u201909), p 398\u2013409","DOI":"10.1109\/RTSS.2009.31"},{"issue":"1","key":"9241_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11241-010-9106-5","volume":"47","author":"RI Davis","year":"2011","unstructured":"Davis RI, Burns A (2011a) 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"},{"issue":"4","key":"9241_CR12","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1145\/1978802.1978814","volume":"43","author":"RI Davis","year":"2011","unstructured":"Davis RI, Burns A (2011b) A survey of hard real-time scheduling for multiprocessor systems. ACM Comput Surv 43(4):35","journal-title":"ACM Comput Surv"},{"key":"9241_CR13","doi-asserted-by":"crossref","unstructured":"Guan N, Stigge M, Yi W, Yu G (2009) New response time bounds for fixed priority multiprocessor scheduling. In: Proceedings of the real-time systems symposium, p 388\u2013397","DOI":"10.1109\/RTSS.2009.11"},{"key":"9241_CR14","unstructured":"Ha R, Liu JWS (1994) Validating timing constraints in multiprocessor and distributed real-time systems. In: Proceedings of the international conference on distributed computing systems, p 162\u2013171"},{"key":"9241_CR15","doi-asserted-by":"crossref","unstructured":"Lauzac S, Melhem R, Mosse D (1998) Comparison of global and partitioning schemes for scheduling rate monotonic tasks on a multiprocessor. In: Proceedings of the euromicro workshop on real-time systems, p 188\u2013195","DOI":"10.1109\/EMWRTS.1998.685084"},{"issue":"1","key":"9241_CR16","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"}],"container-title":["Real-Time Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11241-015-9241-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11241-015-9241-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-9241-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T07:09:56Z","timestamp":1559372996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11241-015-9241-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,25]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["9241"],"URL":"https:\/\/doi.org\/10.1007\/s11241-015-9241-0","relation":{},"ISSN":["0922-6443","1573-1383"],"issn-type":[{"type":"print","value":"0922-6443"},{"type":"electronic","value":"1573-1383"}],"subject":[],"published":{"date-parts":[[2015,9,25]]}}}