{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T01:07:11Z","timestamp":1769044031262,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Real-Time Syst"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s11241-014-9216-6","type":"journal-article","created":{"date-parts":[[2015,1,12]],"date-time":"2015-01-12T04:57:09Z","timestamp":1421038629000},"page":"36-76","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Utilization-based admission control for aperiodic tasks under EDF scheduling"],"prefix":"10.1007","volume":"51","author":[{"given":"Chang","family":"Leng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Qiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaobo Sharon","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,1,13]]},"reference":[{"issue":"3","key":"9216_CR1","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1109\/TC.2004.1261839","volume":"53","author":"TF Abdelzaher","year":"2004","unstructured":"Abdelzaher TF, Sharma V, Lu C (2004) A utilization bound for aperiodic tasks and priority driven scheduling. IEEE Trans Comput 53(3):334\u2013350","journal-title":"IEEE Trans Comput"},{"key":"9216_CR2","doi-asserted-by":"crossref","unstructured":"Abdelzaher T, Sharma V (2003) A synthetic utilization bound for aperiodic tasks with resource requirements. In: Proceedings of the 15th euromicro conference on real-time systems. IEEE Computer Society, pp 141\u2013150","DOI":"10.1109\/EMRTS.2003.1212737"},{"issue":"2","key":"9216_CR3","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.jcss.2006.04.001","volume":"73","author":"B Andersson","year":"2007","unstructured":"Andersson B, Ekelin C (2007) Exact admission-control for integrated aperiodic and periodic tasks. J Comput Syst Sci 73(2):225\u2013241","journal-title":"J Comput Syst Sci"},{"key":"9216_CR4","doi-asserted-by":"crossref","unstructured":"Bansal N, Pruhs K (2010) The geometry of scheduling. In: Proceedings of the 51st annual IEEE symposium on foundations of computer science. IEEE Computer Society, pp 407\u2013414","DOI":"10.1109\/FOCS.2010.46"},{"issue":"6","key":"9216_CR5","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1007\/BF01940883","volume":"15","author":"SK Baruah","year":"1996","unstructured":"Baruah SK, Cohen NK, Plaxton CG, Varvel DA (1996) Proportionate progress: a notion of fairness in resource allocation. Algorithmica 15(6):600\u2013625","journal-title":"Algorithmica"},{"issue":"3","key":"9216_CR6","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/j.jss.2004.09.002","volume":"78","author":"A Brodnik","year":"2005","unstructured":"Brodnik A, Carlsson S, Fredman ML, Karlsson J, Munro JI (2005) Worst case constant time priority queue. J Syst Softw 78(3):249\u2013256","journal-title":"J Syst Softw"},{"key":"9216_CR7","volume-title":"Responsive computer systems: steps toward fault-tolerant real-time systems","author":"GC Buttazzo","year":"1995","unstructured":"Buttazzo GC, Stankovic JA (1995) Adding robustness in dynamic preemptive scheduling. In: Fussell, Malek (eds) Responsive computer systems: steps toward fault-tolerant real-time systems. Kluwer Academic Publishers, Dordrecht"},{"issue":"3","key":"9216_CR8","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF00365326","volume":"2","author":"H Chetto","year":"1990","unstructured":"Chetto H, Silly M, Bouchentouf T (1990) Dynamic scheduling of real-time tasks under precedence constraints. Real-Time Syst 2(3):181\u2013194","journal-title":"Real-Time Syst"},{"issue":"4","key":"9216_CR9","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/2185395.2185398","volume":"39","author":"S Gopalakrishnan","year":"2012","unstructured":"Gopalakrishnan S (2012) Sharp utilization thresholds for some realtime scheduling problems. SIGMETRICS Perform Eval Rev 39(4):12\u201322","journal-title":"SIGMETRICS Perform Eval Rev"},{"issue":"3","key":"9216_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1952522.1952524","volume":"10","author":"X Liu","year":"2011","unstructured":"Liu X, Abdelzaher T (2011) Nonutilization bounds and feasible regions for arbitrary fixed-priority policies. ACM Trans Embed Comput Syst 10(3):1\u201325","journal-title":"ACM Trans Embed Comput Syst"},{"key":"9216_CR11","unstructured":"Liu X, Abdelzaher T (2006) On non-utilization bounds for arbitrary fixed priority policies. In: Proceedings of the 12th IEEE real-time and embedded technology and applications symposium. IEEE Computer Society, pp 167\u2013178"},{"key":"9216_CR12","doi-asserted-by":"crossref","unstructured":"Nie W, Lin KJ, Kim SD (2011) Capacity-based admission control for mixed periodic and aperiodic real time service processes. In: Proceedings of the 2011 IEEE international conference on service-oriented computing and applications. IEEE Computer Society, pp 1\u20138","DOI":"10.1109\/SOCA.2011.6166215"},{"issue":"6","key":"9216_CR13","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/2.386982","volume":"28","author":"JA Stankovic","year":"1995","unstructured":"Stankovic JA, Spuri M, Di Natale M, Buttazzo GC (1995) Implications of classical scheduling results for real-time systems. Computer 28(6):16\u201325","journal-title":"Computer"},{"issue":"1","key":"9216_CR14","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01683268","volume":"10","author":"P Emde Boas van","year":"1976","unstructured":"van Emde Boas P, Kaas R, Zijlstra E (1976) Design and implementation of an efficient priority queue. Math Syst Theory 10(1):99\u2013127","journal-title":"Math Syst Theory"},{"issue":"6","key":"9216_CR15","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1109\/90.650142","volume":"5","author":"G Varghese","year":"1997","unstructured":"Varghese G, Lauck A (1997) Hashed and hierarchical timing wheels: efficient data structures for implementing a timer facility. IEEE\/ACM Trans Netw 5(6):824\u2013834","journal-title":"IEEE\/ACM Trans Netw"}],"container-title":["Real-Time Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11241-014-9216-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11241-014-9216-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11241-014-9216-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T11:02:06Z","timestamp":1566212526000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11241-014-9216-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["9216"],"URL":"https:\/\/doi.org\/10.1007\/s11241-014-9216-6","relation":{},"ISSN":["0922-6443","1573-1383"],"issn-type":[{"value":"0922-6443","type":"print"},{"value":"1573-1383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1]]}}}