{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:12:23Z","timestamp":1763467943414,"version":"3.37.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,9,11]],"date-time":"2009-09-11T00:00:00Z","timestamp":1252627200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s00453-009-9360-x","type":"journal-article","created":{"date-parts":[[2009,9,10]],"date-time":"2009-09-10T19:11:31Z","timestamp":1252609891000},"page":"464-480","source":"Crossref","is-referenced-by-count":1,"title":["On Centralized Smooth Scheduling"],"prefix":"10.1007","volume":"60","author":[{"given":"Ami","family":"Litman","sequence":"first","affiliation":[]},{"given":"Shiri","family":"Moran-Schein","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,9,11]]},"reference":[{"key":"9360_CR1","doi-asserted-by":"crossref","unstructured":"Adler, M., Berenbrink, P., Friedetzky, T., Goldberg, L.A., Goldberg, P., Paterson, M.: A proportionate fair scheduling rule with good worst-case performance. In: Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architecture, pp.\u00a0101\u2013108 (2003)","DOI":"10.1145\/777412.777430"},{"key":"9360_CR2","doi-asserted-by":"crossref","unstructured":"Anderson, J., Srinivasan, A.: Early-release fair scheduling. In: Proc. of the 12th Euromicro Conference on Real-Time Systems, pp.\u00a035\u201343 (2000)","DOI":"10.1109\/EMRTS.2000.853990"},{"key":"9360_CR3","doi-asserted-by":"crossref","unstructured":"Anderson, J., Srinivasan, A.: Pfair scheduling: Beyond periodic task systems. In:\u00a0Proc. of the 7th International Conference on Real-Time Computing Systems and Applications, pp.\u00a0297\u2013306 (2000)","DOI":"10.1109\/RTCSA.2000.896405"},{"key":"9360_CR4","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.jcss.2003.08.002","volume":"68","author":"J.H. Anderson","year":"2004","unstructured":"Anderson, J.H., Srinivasan, A.: Mixed Pfair\/ERfair scheduling of asynchronous periodic tasks. Comput. Syst. Sci. 68, 157\u2013204 (2004)","journal-title":"Comput. Syst. Sci."},{"key":"9360_CR5","unstructured":"Andersson, B., Baruah, S.K., Jonsson, J.: Static-priority scheduling on multiprocessors. Technical Report TR01-016, Department of Computer Science, University of North Carolina, Chapel Hill (2001)"},{"issue":"4","key":"9360_CR6","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/S0097539795282092","volume":"27","author":"A. Bar-Noy","year":"1998","unstructured":"Bar-Noy, A., Mayer, A., Schieber, B., Sudan, M.: Guaranteeing fair service to persistent dependent tasks. SIAM J. Comput. 27(4), 1168\u20131189 (1998)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"9360_CR7","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1007\/BF01940883","volume":"15","author":"S.K. Baruah","year":"1996","unstructured":"Baruah, S.K., Cohen, N.K., Plaxton, C.G., Varvel, D.A.: Proportionate progress: a notion of fairness in resource allocation. Algoritmica 15(6), 600\u2013625 (1996). Extended abstract was presented at The 25th Annual ACM Symposium on the Theory of Computing. May 1993","journal-title":"Algoritmica"},{"key":"9360_CR8","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1109\/IPPS.1995.395946","volume-title":"Proceedings of the 9th International Parallel Processing Symposium","author":"S.K. Baruah","year":"1995","unstructured":"Baruah, S.K., Gehrke, J., Plaxton, G.: Fast scheduling of periodic tasks on multiple resources. In: Proceedings of the 9th International Parallel Processing Symposium, pp. 280\u2013288. IEEE Computer Society, Los Alamitos (1995)"},{"key":"9360_CR9","unstructured":"Chandra, A., Adler, M., Goyal, P., Shenoy, P.: Surplus fair scheduling: A Proportional-Share CPU scheduling algorithm for symmetric multiprocessors. In: Proceedings of the USENIX 4th Symposium on Operating System Design and Implementation, pp.\u00a045\u201358 (2000)"},{"key":"9360_CR10","doi-asserted-by":"crossref","unstructured":"Chandra, A., Adler, M., Shenoy, P.: Deadline fair scheduling: Bridging the theory and practice of proportionate-fair scheduling in multiprocessor servers. In: Proceedings of the 7th IEEE Real-Time Technology and Applications Symposium, pp.\u00a03\u201314 (2001)","DOI":"10.1109\/RTTAS.2001.929861"},{"key":"9360_CR11","volume-title":"Introduction to algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms, 2nd edn. MIT Press\/McGraw\u2013Hill, Cambridge\/New York (2001)","edition":"2"},{"key":"9360_CR12","doi-asserted-by":"crossref","unstructured":"Holman, P., Anderson, J.: Guaranteeing pfair supertasks by reweighting. In: Proceedings of the 22nd IEEE Real-time Systems Symposium, pp.\u00a0203\u2013212 (2001)","DOI":"10.1109\/REAL.2001.990612"},{"key":"9360_CR13","unstructured":"Lincoln, A.J., Even, S., Cohn, M.: Pulse sequences. In: Proceedings of the Third Annual Princeton Conference on Information Sciences and Systems, pp.\u00a0350\u2013354 (1969)"},{"key":"9360_CR14","unstructured":"Litman, A., Moran-Schein, S.: On centralized smooth scheduling. Technical Report CS-2005-04, Department of Computer Science, Technion\u2014Israel Institute of Technology, 2005. Available at: http:\/\/www.cs.technion.ac.il\/users\/wwwb\/cgi-bin\/tr-info.cgi?2005\/CS\/CS-2005-04"},{"key":"9360_CR15","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1145\/1073970.1073982","volume-title":"Proceedings of the seventeenth annual ACM symposium on Parallel algorithms and architectures","author":"A. Litman","year":"2005","unstructured":"Litman, A., Moran-Schein, S.: On distributed smooth scheduling. In: Proceedings of the seventeenth annual ACM symposium on Parallel algorithms and architectures, pp. 76\u201385. ACM, New York (2005). The full version of this extended abstract is available at: http:\/\/www.cs.technion.ac.il\/users\/wwwb\/cgi-bin\/tr-info.cgi?2005\/CS\/CS-2005-03"},{"key":"9360_CR16","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1016\/j.disc.2008.01.051","volume":"309","author":"A. Litman","year":"2008","unstructured":"Litman, A., Moran-Schein, S.: On smooth sets of integers. Discrete Math. 309, 797\u2013813 (2008)","journal-title":"Discrete Math."},{"key":"9360_CR17","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s00224-008-9134-x","volume":"45","author":"A. Litman","year":"2009","unstructured":"Litman, A., Moran-Schein, S.: Smooth scheduling under variable rates or the analog-digital confinement game. J. Theory Comput. Syst. 45, 325\u2013354 (2009). Special issues of SPAA 2006","journal-title":"J. Theory Comput. Syst."},{"key":"9360_CR18","unstructured":"Liu, C.L.: Scheduling algorithms for multiprocessors in hard-real-time environment. JPL space program summary 37\u201360, vol. II, Propulsion Lab., Calif. Inst. of Tech., Pasadena, CA, pp. 28\u201337 (1969)"},{"key":"9360_CR19","doi-asserted-by":"crossref","unstructured":"Moir, M., Ramamurthy, S.: Pfair scheduling of fixed and migrating periodic tasks on multiple resources. In: The 20th IEEE Real-Time Systems Symposium, pp. 294\u2013303 (1999)","DOI":"10.1109\/REAL.1999.818857"},{"key":"9360_CR20","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0012-365X(80)90269-1","volume":"32","author":"R. Tijdeman","year":"1980","unstructured":"Tijdeman, R.: The chairman assignment problem. Discrete Math. 32, 323\u2013330 (1980)","journal-title":"Discrete Math."},{"key":"9360_CR21","first-page":"1058","volume":"38","author":"J.G. Corput Van der","year":"1935","unstructured":"Van der Corput, J.G.: Verteilungsfunktionen ii. Proc. Ned. Akad. v. Wet. 38, 1058\u20131066 (1935)","journal-title":"Proc. Ned. Akad. v. Wet."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9360-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-009-9360-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9360-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T03:00:52Z","timestamp":1739329252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-009-9360-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,11]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["9360"],"URL":"https:\/\/doi.org\/10.1007\/s00453-009-9360-x","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2009,9,11]]}}}