{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T07:52:11Z","timestamp":1764402731506,"version":"3.28.0"},"reference-count":33,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1109\/infocom.2016.7524430","type":"proceedings-article","created":{"date-parts":[[2016,7,28]],"date-time":"2016-07-28T20:47:54Z","timestamp":1469738874000},"page":"1-9","source":"Crossref","is-referenced-by-count":36,"title":["Online multi-resource allocation for deadline sensitive jobs with partial values in the cloud"],"prefix":"10.1109","author":[{"given":"Zizhan","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Ness B.","family":"Shroff","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1145\/2602044.2602053"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1109\/CLOUD.2015.47"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1109\/INFOCOM.2014.6847966"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1016\/j.ejor.2013.12.035"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1016\/j.jda.2005.03.005"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1007\/s00453-003-1025-6"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1007\/3-540-45465-9_68"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1016\/S0022-0000(03)00070-9"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1137\/1.9781611973402.83"},{"key":"ref15","article-title":"Dominant resource fairness: Fair allocation of multiple resource types","author":"ghodsi","year":"2011","journal-title":"Proc of NSDI"},{"key":"ref16","article-title":"Online primal-dual for nonlinear optimization with applications to speed scaling","author":"gupta","year":"2012","journal-title":"10th Workshop on Approximation and Online Algorithms (WAOA)"},{"key":"ref17","article-title":"On the competitiveness of on-line scheduling of unit-length packets with hard deadlines in slotted time","author":"hajek","year":"2001","journal-title":"Conference on Information Sciences and Systems"},{"key":"ref18","article-title":"Scheduling interactive services with partial execution","author":"he","year":"2012","journal-title":"Proc Of SoCC"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1145\/2742343"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1145\/2591971.2591980"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1016\/S0377-2217(01)00179-5"},{"key":"ref27","article-title":"The user and business impact of server delays, additional bytes, and http chunking in web search","author":"schurman","year":"2009","journal-title":"Velocity Web Performance and Operations Conference"},{"year":"2005","author":"borodin","journal-title":"Online Computation and Competitive Analysis","key":"ref3"},{"year":"2009","author":"brutlag","journal-title":"Speed Matters for Google Web Search","key":"ref6"},{"year":"2009","author":"souders","journal-title":"Velocity and the bottom line","key":"ref29"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1137\/090772988"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1023\/A:1022904408360"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1561\/0400000024","article-title":"The design of competitive online algorithms via a primal-dual approach","volume":"3","author":"buchbinder","year":"2007","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"year":"1999","author":"bertsekas","journal-title":"Nonlinear Programming","key":"ref2"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1137\/S0097539799356265"},{"key":"ref1","article-title":"Grass: Trimming stragglers in approximation analytics","author":"ananthanarayanan","year":"2014","journal-title":"Proc of NSDI"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/TNET.2012.2233213"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1145\/380752.380847"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1613\/jair.4405","article-title":"No agent left behind: Dynamic fair division of multiple resources","volume":"51","author":"kash","year":"2014","journal-title":"Journal of Artificial Intelligence Research"},{"year":"2006","author":"linden","journal-title":"Marissa Mayer at Web 2 0","key":"ref24"},{"key":"ref23","article-title":"Dover: an optimal on-line scheduling algorithm for overloaded real-time systems","author":"koren","year":"1992","journal-title":"Real-Time Systems Symposium"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1145\/2739040"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1145\/2486159.2486187"}],"event":{"name":"IEEE INFOCOM 2016 - IEEE Conference on Computer Communications","start":{"date-parts":[[2016,4,10]]},"location":"San Francisco, CA, USA","end":{"date-parts":[[2016,4,14]]}},"container-title":["IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7515093\/7524326\/07524430.pdf?arnumber=7524430","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T22:02:31Z","timestamp":1568239351000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7524430\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/infocom.2016.7524430","relation":{},"subject":[],"published":{"date-parts":[[2016,4]]}}}