{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:50:11Z","timestamp":1740124211413,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,8,5]],"date-time":"2008-08-05T00:00:00Z","timestamp":1217894400000},"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":[[2009,1]]},"DOI":"10.1007\/s11241-008-9054-5","type":"journal-article","created":{"date-parts":[[2008,8,4]],"date-time":"2008-08-04T10:03:28Z","timestamp":1217844208000},"page":"1-26","source":"Crossref","is-referenced-by-count":7,"title":["The feasibility of general task systems with precedence constraints on multiprocessor platforms"],"prefix":"10.1007","volume":"41","author":[{"given":"Nathan","family":"Fisher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjoy","family":"Baruah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,8,5]]},"reference":[{"key":"9054_CR1","doi-asserted-by":"crossref","unstructured":"Abdelzaher T, Lu C (2004) A utilization bound for aperiodic tasks and priority driven scheduling. IEEE Trans Comput 53(3)","DOI":"10.1109\/TC.2004.1261839"},{"key":"9054_CR2","first-page":"178","volume-title":"Proceedings of the IEEE real-time systems symposium","author":"T Baker","year":"2006","unstructured":"Baker T, Cirinei M. (2006) A necessary and sometimes sufficient condition for the feasibility of sets of sporadic hard-deadline tasks. In: Proceedings of the IEEE real-time systems symposium. IEEE Computer Society Press, Rio de Janeiro, pp 178\u2013190"},{"issue":"1","key":"9054_CR3","first-page":"99","volume":"24","author":"S Baruah","year":"2003","unstructured":"Baruah S (2003) Dynamic- and static-priority scheduling of recurring real-time tasks. Real-Time Syst Int J Time-Critical Comput 24(1):99\u2013128","journal-title":"Real-Time Syst Int J Time-Critical Comput"},{"issue":"7","key":"9054_CR4","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1109\/TC.2006.113","volume":"55","author":"S Baruah","year":"2006","unstructured":"Baruah S, Fisher N (2006) The partitioned multiprocessor scheduling of deadline-constrained sporadic task systems. IEEE Trans Comput 55(7):918\u2013923","journal-title":"IEEE Trans Comput"},{"key":"9054_CR5","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/REAL.1990.128746","volume-title":"Proceedings of the 11th real-time systems symposium","author":"S Baruah","year":"1990","unstructured":"Baruah S, Mok A, Rosier L (1990) Preemptively scheduling hard-real-time sporadic tasks on one processor. In: Proceedings of the 11th real-time systems symposium. IEEE Computer Society Press, Orlando, pp 182\u2013190"},{"issue":"1","key":"9054_CR6","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1008030427220","volume":"17","author":"S Baruah","year":"1999","unstructured":"Baruah S, Chen D, Gorinsky S, Mok A (1999) Generalized multiframe tasks. Real-Time Syst Int J Time-Critical Comput 17(1):5\u201322","journal-title":"Real-Time Syst Int J Time-Critical Comput"},{"issue":"2","key":"9054_CR7","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1137\/0210018","volume":"10","author":"MR Garey","year":"1981","unstructured":"Garey MR, Johnson DS, Simons BB, Tarjan RE (1981) Scheduling unit-time tasks with arbitrary release times and deadlines. SIAM J Comput 10(2):256\u2013269","journal-title":"SIAM J Comput"},{"key":"9054_CR8","volume-title":"Introductory real analysis","author":"AN Kolmogorov","year":"1970","unstructured":"Kolmogorov AN, Fomin SV (1970) Introductory real analysis. Dover, New York"},{"issue":"1","key":"9054_CR9","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321738.321743","volume":"20","author":"C Liu","year":"1973","unstructured":"Liu C, Layland J (1973) Scheduling algorithms for multiprogramming in a hard real-time environment. J\u00a0ACM 20(1):46\u201361","journal-title":"J\u00a0ACM"},{"key":"9054_CR10","volume-title":"Fundamental design problems of distributed systems for the hard-real-time environment","author":"AK Mok","year":"1983","unstructured":"Mok AK (1983) Fundamental design problems of distributed systems for the hard-real-time environment. PhD thesis, Laboratory for Computer Science, Massachusetts Institute of Technology. Available as Technical Report No. MIT\/LCS\/TR-297"},{"issue":"10","key":"9054_CR11","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1109\/32.637146","volume":"23","author":"AK Mok","year":"1997","unstructured":"Mok AK, Chen D (1997) A multiframe model for real-time tasks. IEEE Trans Softw Eng 23(10):635\u2013645","journal-title":"IEEE Trans Softw Eng"},{"key":"9054_CR12","volume-title":"Linear programming","author":"KG Murty","year":"1983","unstructured":"Murty KG (1983) Linear programming. Wiley, New York"},{"issue":"3","key":"9054_CR13","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/90.234856","volume":"1","author":"AK Parekh","year":"1993","unstructured":"Parekh AK, Gallager RG (1993) A generalized processor sharing approach to flow control in integrated services networks: the single node case. IEEE\/ACM Trans Netw 1(3):344\u2013357","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"2","key":"9054_CR14","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1109\/90.298432","volume":"2","author":"AK Parekh","year":"1994","unstructured":"Parekh AK, Gallager RG (1994) A generalized processor sharing approach to flow control in integrated services networks: the multiple node case. IEEE\/ACM Trans Netw 2(2):137\u2013150","journal-title":"IEEE\/ACM Trans Netw"},{"key":"9054_CR15","unstructured":"Phillips CA, Stein C, Torng E, Wein J (1997) Optimal time-critical scheduling via resource augmentation. In: Proceedings of the twenty-ninth annual ACM symposium on theory of computing, El Paso, TX, 4\u20136 May 1997, pp 140\u2013149"},{"issue":"12","key":"9054_CR16","doi-asserted-by":"crossref","first-page":"1407","DOI":"10.1109\/12.338100","volume":"43","author":"M Spuri","year":"1994","unstructured":"Spuri M, Stankovic JA (1994) How to integrate precedence constraints and shared resources in real-time scheduling. IEEE Trans Comput 43(12):1407\u20131412. doi: http:\/\/dx.doi.org\/10.1109\/12.338100","journal-title":"IEEE Trans Comput"}],"container-title":["Real-Time Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11241-008-9054-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11241-008-9054-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11241-008-9054-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T07:09:51Z","timestamp":1559372991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11241-008-9054-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,5]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["9054"],"URL":"https:\/\/doi.org\/10.1007\/s11241-008-9054-5","relation":{},"ISSN":["0922-6443","1573-1383"],"issn-type":[{"type":"print","value":"0922-6443"},{"type":"electronic","value":"1573-1383"}],"subject":[],"published":{"date-parts":[[2008,8,5]]}}}