{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T09:39:30Z","timestamp":1729676370264,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1109\/allerton.2011.6120300","type":"proceedings-article","created":{"date-parts":[[2012,1,6]],"date-time":"2012-01-06T21:40:38Z","timestamp":1325886038000},"page":"1170-1181","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling for data center interactive services"],"prefix":"10.1109","author":[{"given":"Yuxiong","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sameh","family":"Elnikety","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5535-3"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0510886103"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/151244.151246"},{"key":"15","article-title":"Trade-offs between speed and processor in hard-deadline scheduling","author":"lam","year":"1999","journal-title":"SODA"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/BF02248588"},{"key":"13","article-title":"Online scheduling with tight deadlines","author":"koo","year":"2001","journal-title":"Mathematical Foundations of Computer Science"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792236882"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2011.91"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/347476.347479"},{"key":"21","first-page":"73","article-title":"Using anytime algorithms in intelligent systems","volume":"17","author":"zilberstein","year":"1996","journal-title":"AI Magazine"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/BF00365406"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492493"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.24"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806620"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"10"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-003-1025-6"},{"key":"6","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45071-8_43","article-title":"Improved competitive algorithms for online scheduling with partial job values","author":"chin","year":"2003","journal-title":"Computing and Combinatorics"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775184"},{"key":"4","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-44679-6_51","article-title":"Competitive online scheduling with level of service","author":"chang","year":"2001","journal-title":"Computing and Combinatorics"},{"key":"9","first-page":"431","author":"fox","year":"1999","journal-title":"Mobility Chapter Adapting to Network and Client Variation Using Infrastructural Process Proxies Lessons and Perspectives"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00070-9"}],"event":{"name":"2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2011,9,28]]},"location":"Monticello, IL","end":{"date-parts":[[2011,9,30]]}},"container-title":["2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6111659\/6120135\/06120300.pdf?arnumber=6120300","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T05:41:17Z","timestamp":1561182077000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6120300\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/allerton.2011.6120300","relation":{},"subject":[],"published":{"date-parts":[[2011,9]]}}}