{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T17:40:17Z","timestamp":1737740417009,"version":"3.33.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,12,22]],"date-time":"2007-12-22T00:00:00Z","timestamp":1198281600000},"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":[[2008,4]]},"DOI":"10.1007\/s11241-007-9045-y","type":"journal-article","created":{"date-parts":[[2007,12,21]],"date-time":"2007-12-21T16:03:01Z","timestamp":1198252981000},"page":"237-288","source":"Crossref","is-referenced-by-count":3,"title":["A schedulable utilization bound for the multiprocessor $\\mathsf{EPDF}$ Pfair algorithm"],"prefix":"10.1007","volume":"38","author":[{"given":"UmaMaheswari C.","family":"Devi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James H.","family":"Anderson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,12,22]]},"reference":[{"key":"9045_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal V, Hrishikesh MS, Keckler S, Burger D (2000) Clock rate versus ipc: The end of the road for conventional microarchitectures. In: Proceedings of the 27th international symposium on computer architecture, June 2000, pp 248\u2013259","DOI":"10.1145\/339647.339691"},{"key":"9045_CR2","doi-asserted-by":"crossref","unstructured":"Anderson J, Srinivasan A (2000a) Early-release fair scheduling. In: Proceedings of the 12th Euromicro conference on real-time systems, June 2000, pp 35\u201343","DOI":"10.1109\/EMRTS.2000.853990"},{"key":"9045_CR3","doi-asserted-by":"crossref","unstructured":"Anderson J, Srinivasan A (2000b) Pfair scheduling: Beyond periodic task systems. In: Proceedings of the 7th international conference on real-time computing systems and applications, December 2000, pp 297\u2013306","DOI":"10.1109\/RTCSA.2000.896405"},{"issue":"1","key":"9045_CR4","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.jcss.2003.08.002","volume":"68","author":"J Anderson","year":"2004","unstructured":"Anderson J, Srinivasan A (2004) Mixed Pfair\/ERfair scheduling of asynchronous periodic tasks. J Comput Syst Sci 68(1):157\u2013204","journal-title":"J Comput Syst Sci"},{"key":"9045_CR5","doi-asserted-by":"crossref","unstructured":"Anderson J, Baruah S, Jeffay K (1999) Parallel switching in connection-oriented networks. In: Proceedings of the 20th IEEE real-time systems symposium, December 1999, IEEE, pp 200\u2013209","DOI":"10.1109\/REAL.1999.818843"},{"key":"9045_CR6","doi-asserted-by":"crossref","unstructured":"Andersson B, Jonsson J (2003) The utilization bounds of partitioned and pfair static-priority scheduling on multiprocessors are 50%. In: Proceedings of the 15th Euromicro conference on real-time systems, July 2003, pp 33\u201340","DOI":"10.1109\/EMRTS.2003.1212725"},{"key":"9045_CR7","doi-asserted-by":"crossref","unstructured":"Andersson B, Baruah S, Jonsson J (2001) Static priority scheduling on multiprocessors. In: Proceedings of the 22nd real-time systems symposium, December 2001, pp 193\u2013202","DOI":"10.1109\/REAL.2001.990610"},{"key":"9045_CR8","doi-asserted-by":"crossref","unstructured":"Baker TP (2003) Multiprocessor EDF and deadline monotonic schedulability analysis. In: Proceedings of the 24th IEEE real-time systems symposium, December 2003, pp 120\u2013129","DOI":"10.1109\/REAL.2003.1253260"},{"key":"9045_CR9","unstructured":"Baker T, Fisher N, Baruah S (2005) Algorithms for determining the load of a sporadic task system. Technical Report TR-051201, Department of Computer Science, Florida State University, December 2005"},{"issue":"5","key":"9045_CR10","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1109\/JLT.2002.1007930","volume":"20","author":"E Bampis","year":"2002","unstructured":"Bampis E, Rouskas GN (2002) The scheduling and wavelength assignment problem in optical WDM networks. J Light Technol 20(5):782\u2013789","journal-title":"J Light Technol"},{"key":"9045_CR11","doi-asserted-by":"crossref","unstructured":"Baruah S (1995) Fairness in periodic real-time scheduling. In: Proceedings of the 16th IEEE real-time systems symposium, December 1995, pp 200\u2013209","DOI":"10.1109\/REAL.1995.495210"},{"issue":"6","key":"9045_CR12","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1109\/TC.2004.16","volume":"53","author":"S Baruah","year":"2004","unstructured":"Baruah S (2004) Optimal utilization bounds for the fixed-priority scheduling of periodic task systems on identical multiprocessors. IEEE Trans Comput 53(6):781\u2013784","journal-title":"IEEE Trans Comput"},{"key":"9045_CR13","doi-asserted-by":"crossref","unstructured":"Baruah S, Carpenter J (2003) Multiprocessor fixed-priority scheduling with restricted inter-processor migrations. In: Proceedings of the 15th Euromicro conference on real-time systems, July 2003, pp 195\u2013202","DOI":"10.1109\/EMRTS.2003.1212744"},{"key":"9045_CR14","doi-asserted-by":"crossref","unstructured":"Baruah S, Fisher N (2005) The partitioned multiprocessor scheduling of sporadic task systems. In: Proceedings of the 26th real-time systems symposium, December 2005, pp 321\u2013329","DOI":"10.1109\/RTSS.2005.40"},{"issue":"3","key":"9045_CR15","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(93)90360-6","volume":"20","author":"SK Baruah","year":"1993","unstructured":"Baruah SK, Howell RR, Rosier LE (1993) Feasibility problems for recurring tasks on one processor. Theor Comput Sci 20(3):3\u201320","journal-title":"Theor Comput Sci"},{"key":"9045_CR16","doi-asserted-by":"crossref","unstructured":"Baruah S, Gehrke J, Plaxton CG (1995) Fast scheduling of periodic tasks on multiple resources. In: Proceedings of the 9th international parallel processing symposium, April 1995, pp 280\u2013288","DOI":"10.1109\/IPPS.1995.395946"},{"issue":"6","key":"9045_CR17","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1007\/BF01940883","volume":"15","author":"S Baruah","year":"1996","unstructured":"Baruah S, Cohen N, Plaxton CG, Varvel D (1996) Proportionate progress: A notion of fairness in resource allocation. Algorithmica 15(6):600\u2013625","journal-title":"Algorithmica"},{"key":"9045_CR18","doi-asserted-by":"crossref","unstructured":"Block A, Anderson J, Bishop G (2005) Fine-grained task reweighting on multiprocessors. In: Proceedings of the 11th IEEE international conference on embedded and real-time computing systems and applications, August 2005, pp 429\u2013435","DOI":"10.1109\/RTCSA.2005.53"},{"key":"9045_CR19","doi-asserted-by":"crossref","unstructured":"Braden R, Clark D, Shenker S (1994) Integrated services in the Internet architecture: An overview. RFC 1633 (Informational), June 1994","DOI":"10.17487\/rfc1633"},{"key":"9045_CR20","doi-asserted-by":"crossref","unstructured":"Brandenburg B, Anderson J (2007) Integrating hard\/soft real-time tasks and best-effort jobs on multiprocessors. In: Proceedings of the 19th Euromicro conference on real-time systems, July 2007, pp\u00a061\u201370","DOI":"10.1109\/ECRTS.2007.17"},{"key":"9045_CR21","unstructured":"Calandrino J, Leontyev H, Block A, Devi U, Anderson J (2006) LITMUSRT: A testbed for empirically comparing real-time multiprocessor schedulers. In: Proceedings of the 27th IEEE real-time systems symposium, December 2006, pp 111\u2013123"},{"key":"9045_CR22","unstructured":"Chandra A, Adler M, Goyal P, Shenoy P (2000) Surplus fair scheduling: A Proportional-share CPU scheduling algorithm for symmetric multiprocessors. In: Proceedings of the 4th USENIX symposium on operating system design and implemetation, June 2000, pp 45\u201358"},{"key":"9045_CR23","doi-asserted-by":"crossref","unstructured":"Cho H, Ravindran B, Jensen E (2006) An optimal real-time scheduling algorithm for multiprocessors. In: Proceedings of the 27th IEEE real-time systems symposium","DOI":"10.1109\/RTSS.2006.10"},{"key":"9045_CR24","unstructured":"Coffman K, Odlyzko A (2001) The size and growth rate of the Internet. http:\/\/www.firstmonday.org\/issues\/issue3_10\/coffman\/ and http:\/\/www.dtc.umn.edu\/~odlyzko\/doc\/internet.size.pdf , March 2001"},{"key":"9045_CR25","unstructured":"Devi U (2006) Soft real-time scheduling on multiprocessors. Ph.D. thesis, University of North Carolina at Chapel Hill, December 2006"},{"key":"9045_CR26","doi-asserted-by":"crossref","unstructured":"Devi U, Anderson J (2004) Improved conditions for bounded tardiness under EPDF fair multiprocessor scheduling. In: Proceedings of the 12th international workshop on parallel and distributed real-time systems, April 2004, 8\u00a0p (on CD-ROM)","DOI":"10.1109\/IPDPS.2004.1303077"},{"issue":"1","key":"9045_CR27","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1287\/opre.26.1.127","volume":"26","author":"SK Dhall","year":"1978","unstructured":"Dhall SK, Liu CL (1978) On a real-time scheduling problem. Oper Res 26(1):127\u2013140","journal-title":"Oper Res"},{"key":"9045_CR28","doi-asserted-by":"crossref","unstructured":"Fisher N, Baker T, Baruah S (2006) Algorithms for determining the demand-based load of a sporadic task system. In: Proceedings of the 12th IEEE international conference on real-time and embedded computing systems and applications, August 2006","DOI":"10.1109\/RTCSA.2006.12"},{"issue":"2-3","key":"9045_CR29","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1023\/A:1025120124771","volume":"25","author":"J Goossens","year":"2003","unstructured":"Goossens J, Funk S, Baruah S (2003) Priority-driven scheduling of periodic task systems on multiprocessors. Real-Time Syst 25(2-3):187\u2013205","journal-title":"Real-Time Syst"},{"key":"9045_CR30","doi-asserted-by":"crossref","unstructured":"Jeffay K, Goddard S (1999) A theory of rate-based execution. In: Proceedings of the real-time systems symposium, Phoenix, AZ, December 1999. IEEE Computer Society Press, pp 304\u2013314","DOI":"10.1109\/REAL.1999.818858"},{"key":"9045_CR31","doi-asserted-by":"crossref","unstructured":"Kaur J, Vin H (2001) Core-stateless guaranteed rate scheduling algorithms. In: Proceedings of IEEE INFOCOM, April 2001, IEEE, pp 1484\u20131492","DOI":"10.1109\/INFCOM.2001.916644"},{"key":"9045_CR32","doi-asserted-by":"crossref","unstructured":"Kaur J, Vin H (2003) Core-stateless guaranteed throughput networks. In: Proceedings of IEEE INFOCOM, April 2003, IEEE, pp 2155\u20132165","DOI":"10.1109\/INFCOM.2003.1209236"},{"key":"9045_CR33","doi-asserted-by":"crossref","unstructured":"Lehoczky J (1990) Fixed priority scheduling of periodic task sets with arbitrary deadlines. In: Proceedings of the 11st IEEE real-time systems symposium, December 1990, IEEE, pp 201\u2013209","DOI":"10.1109\/REAL.1990.128748"},{"key":"9045_CR34","doi-asserted-by":"crossref","unstructured":"Lehoczky JP, Sha L, Ding Y (1989) Rate-monotonic scheduling algorithm: Exact characterization and average case behavior. In: Proceedings of the 11th IEEE real-time systems symposium, December 1989, pp 166\u2013171","DOI":"10.1109\/REAL.1989.63567"},{"issue":"1","key":"9045_CR35","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 Assoc Comput Mach 20(1):46\u201361","journal-title":"J Assoc Comput Mach"},{"key":"9045_CR36","doi-asserted-by":"crossref","unstructured":"Lopez JM, Garcia M, Diaz JL, Garcia DF (2000) Worst-case utilization bound for EDF scheduling on real-time multiprocessor systems. In: Proceedings of the 12th Euromicro conference on real-time systems, June 2000, pp 25\u201334","DOI":"10.1109\/EMRTS.2000.853989"},{"key":"9045_CR37","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1023\/A:1008098013753","volume":"15","author":"D Oh","year":"1998","unstructured":"Oh D, Baker TP (1998) Utilization bounds for N-processor rate monotone scheduling with static processor assignment. Real-Time Syst: Int J Time-Crit Comput 15:183\u2013192","journal-title":"Real-Time Syst: Int J Time-Crit Comput"},{"key":"9045_CR38","unstructured":"Rajkumar R (2006) Resource kernels: Why resource reservation should be the preferred paradigm of construction of embedded real-time systems. In: Keynote talk, 18th Euromicro conference on real-time systems, Dresden, Germany, July 2006"},{"key":"9045_CR39","doi-asserted-by":"crossref","unstructured":"Ramamurthy S, Moir M (2000) Static-priority periodic scheduling on multiprocessors. In: Proceedings of the 21st IEEE real-time systems symposium, December 2000, pp 69\u201378","DOI":"10.1109\/REAL.2000.895997"},{"key":"9045_CR40","unstructured":"Srinivasan A (2003) Efficient and flexible fair scheduling of real-time tasks on multiprocessors. Ph.D. thesis, University of North Carolina at Chapel Hill, December 2003"},{"key":"9045_CR41","doi-asserted-by":"crossref","unstructured":"Srinivasan A, Anderson J (2002) Optimal rate-based scheduling on multiprocessors. In: Proceedings of the 34th ACM symposium on theory of computing, May 2002, pp 189\u2013198","DOI":"10.1145\/509907.509938"},{"key":"9045_CR42","doi-asserted-by":"crossref","unstructured":"Srinivasan A, Anderson J (2003) Efficient scheduling of soft real-time applications on multiprocessors. In: Proceedings of the 15th Euromicro conference on real-time systems, July 2003, pp 51\u201359","DOI":"10.1109\/EMRTS.2003.1212727"},{"issue":"1","key":"9045_CR43","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.jss.2003.12.041","volume":"77","author":"A Srinivasan","year":"2005","unstructured":"Srinivasan A, Anderson J (2005) Fair scheduling of dynamic task systems on multiprocessors. J Syst Softw 77(1):67\u201380","journal-title":"J Syst Softw"},{"key":"9045_CR44","unstructured":"Srinivasan A, Holman P, Anderson J, Baruah S, Kaur J (2003) Multiprocessor scheduling in processor-based router platforms: Issues and ideas. In: Proceedings of the 2nd workshop on network processors, February 2003, pp 48\u201362"},{"key":"9045_CR45","doi-asserted-by":"crossref","unstructured":"Stoica I, Shenker S, Zhang H (1998) Core-stateless fair queueing: Achieving approximately fair bandwidth allocations in high speed networks. In: SIGCOMM, 1998, pp 118\u2013130","DOI":"10.21236\/ADA363498"},{"key":"9045_CR46","doi-asserted-by":"crossref","unstructured":"Stoica I, Zhang H (1999) Providing guaranteed services without per flow management. In: SIGCOMM, 1999, pp 81\u201394","DOI":"10.1145\/316188.316208"}],"container-title":["Real-Time Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11241-007-9045-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11241-007-9045-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11241-007-9045-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T17:22:27Z","timestamp":1737739347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11241-007-9045-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,22]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,4]]}},"alternative-id":["9045"],"URL":"https:\/\/doi.org\/10.1007\/s11241-007-9045-y","relation":{},"ISSN":["0922-6443","1573-1383"],"issn-type":[{"type":"print","value":"0922-6443"},{"type":"electronic","value":"1573-1383"}],"subject":[],"published":{"date-parts":[[2007,12,22]]}}}