{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,2]],"date-time":"2024-02-02T00:29:13Z","timestamp":1706833753335},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1997,10]]},"DOI":"10.1016\/s0020-0190(97)00149-x","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:36:00Z","timestamp":1051130160000},"page":"43-51","source":"Crossref","is-referenced-by-count":15,"title":["Fair on-line scheduling of a dynamic set of tasks on a single resource"],"prefix":"10.1016","volume":"64","author":[{"given":"Sanjoy K.","family":"Baruah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes E.","family":"Gehrk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.Greg","family":"Plaxton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ion","family":"Stoica","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hussein","family":"Abdel-Wahab","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"Jeffay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00149-X_BIB1","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1007\/BF01940883","article-title":"Proportionate progress: A notion of fairness in resource allocation","volume":"15","author":"Baruah","year":"1996","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(97)00149-X_BIB2","doi-asserted-by":"crossref","DOI":"10.1109\/IPPS.1995.395946","article-title":"Fast scheduling of periodic tasks on multiple resources","author":"Baruah","year":"1995"},{"key":"10.1016\/S0020-0190(97)00149-X_BIB3","series-title":"Proc. 9th Internat. Parallel Processing Symp.","first-page":"280","article-title":"Fast scheduling of periodic tasks on multiple resources","author":"Baruah","year":"1995"},{"key":"10.1016\/S0020-0190(97)00149-X_BIB4","series-title":"Proc. IEEE INFOCOM'96","first-page":"120","article-title":"WF2Q: Worst-case fair queueing","author":"Bennett","year":"1996"},{"key":"10.1016\/S0020-0190(97)00149-X_BIB5","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0020-0190(97)00149-X_BIB6","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1109\/18.61109","article-title":"A calculus for network delay, Part I: Network elements in isolation","volume":"37","author":"Cruz","year":"1991","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0020-0190(97)00149-X_BIB7","first-page":"3","article-title":"Analysis and simulation of a fair queueing algorithm","author":"Demers","year":"1990","journal-title":"J. Internetworking Res. and Experience"},{"key":"10.1016\/S0020-0190(97)00149-X_BIB8","article-title":"Charge-based proportional scheduling","author":"Maheshwari","year":"1995"},{"key":"10.1016\/S0020-0190(97)00149-X_BIB9","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1137\/0214021","article-title":"Priority search trees","volume":"14","author":"McCreight","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(97)00149-X_BIB10","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/90.234856","article-title":"A generalized processor sharing approach to flow control in integrated services networks: The single node case","volume":"1","author":"Parekh","year":"1993","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"10.1016\/S0020-0190(97)00149-X_BIB11","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1109\/90.298432","article-title":"A generalized processor sharing approach to flow control in integrated services networks: The multiple node case","volume":"2","author":"Parekh","year":"1994","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"10.1016\/S0020-0190(97)00149-X_BIB12","article-title":"Earliest eligible virtual deadline first: A flexible and accurate mechanism for proportional share resource allocation","author":"Stoica","year":"1995"},{"key":"10.1016\/S0020-0190(97)00149-X_BIB13","article-title":"A new approach to implement proportional share resource allocation","author":"Stoica","year":"1995"},{"key":"10.1016\/S0020-0190(97)00149-X_BIB14","series-title":"Proc. 17th Ann. IEEE Real-Time Systems Symp.","article-title":"A proportional share resource allocation algorithm for real-time, time-shared systems","author":"Stoica","year":"1996"},{"key":"10.1016\/S0020-0190(97)00149-X_BIB15","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0012-365X(80)90269-1","article-title":"The chairman assignment problem","volume":"32","author":"Tijdeman","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/S0020-0190(97)00149-X_BIB16","article-title":"Lottery and stride scheduling: Flexible proportional-share resource management","author":"Waldspurger","year":"1995"},{"key":"10.1016\/S0020-0190(97)00149-X_BIB17","series-title":"Proc. 1st Symp. on Operating System Design and Implementation","first-page":"1","article-title":"Lottery scheduling: Flexible proportional-share resource management","author":"Waldspurger","year":"1994"},{"key":"10.1016\/S0020-0190(97)00149-X_BIB18","article-title":"Stride scheduling: Deterministic proportional-share resource management","author":"Waldspurger","year":"1995"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001909700149X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001909700149X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T16:54:22Z","timestamp":1556643262000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002001909700149X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,10]]}},"alternative-id":["S002001909700149X"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00149-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1997,10]]}}}