{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T14:44:44Z","timestamp":1746283484665},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1109\/infocom.2014.6848160","type":"proceedings-article","created":{"date-parts":[[2014,7,29]],"date-time":"2014-07-29T15:18:13Z","timestamp":1406647093000},"page":"2175-2183","source":"Crossref","is-referenced-by-count":20,"title":["Joint scheduling of MapReduce jobs with servers: Performance bounds and experiments"],"prefix":"10.1109","author":[{"given":"Yi","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Dan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jiangchuan","family":"Liu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1145\/1998582.1998637"},{"journal-title":"Joint Scheduling of Mapreduce Jobs with Servers Performance Bounds and Experiments (Msjo Package)","year":"2014","author":"yuan","key":"22"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799358094"},{"key":"18","article-title":"Computers and intractability","author":"garey","year":"1990","journal-title":"A Guide to the Theory of NP-Completeness"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/363095.363144"},{"journal-title":"Polytopes and Scheduling","year":"1996","author":"schulz","key":"16"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6566957"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6566959"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465386"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6566956"},{"key":"21","article-title":"Predicting execution bottlenecks in map-reduce clusters","author":"bortnikov","year":"2012","journal-title":"Proc USENIX HotCloud"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935152"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS.2013.6550282"},{"journal-title":"MapReduce A Major Step Backwards","year":"2008","author":"dewitt","key":"2"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/1755913.1755940"},{"key":"7","article-title":"Optimizing data shuffling in data-parallel computation by understanding user-defined functions","author":"zhang","year":"2012","journal-title":"Proc USENIX NSDI"},{"journal-title":"Amazon EC2","year":"2013","key":"6"},{"journal-title":"Apache Hadoop","year":"2013","key":"5"},{"key":"4","article-title":"Joint scheduling of processing and shuffle phases in mapreduce systems","author":"chen","year":"2012","journal-title":"Proc IEEE InfoCom"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629601"},{"key":"8","article-title":"Camdoop: Exploiting in-network aggregation for big data applications","author":"costa","year":"2012","journal-title":"Proc USENIX NSDI"}],"event":{"name":"IEEE INFOCOM 2014 - IEEE Conference on Computer Communications","start":{"date-parts":[[2014,4,27]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2014,5,2]]}},"container-title":["IEEE INFOCOM 2014 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6839150\/6847911\/06848160.pdf?arnumber=6848160","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T17:48:30Z","timestamp":1490291310000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6848160\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/infocom.2014.6848160","relation":{},"subject":[],"published":{"date-parts":[[2014,4]]}}}