{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T16:24:29Z","timestamp":1729614269518,"version":"3.28.0"},"reference-count":34,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1109\/infocom.2018.8486323","type":"proceedings-article","created":{"date-parts":[[2018,10,18]],"date-time":"2018-10-18T18:45:36Z","timestamp":1539888336000},"page":"2042-2050","source":"Crossref","is-referenced-by-count":7,"title":["Online Partial Throughput Maximization for Multidimensional Coflow"],"prefix":"10.1109","author":[{"given":"Sungjin","family":"Im","sequence":"first","affiliation":[]},{"given":"Maryam","family":"Shadloo","sequence":"additional","affiliation":[]},{"given":"Zizhan","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755592"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10958-008-9144-x"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"journal-title":"Combinatorial Optimization Polyhedra and Efficiency","year":"2003","author":"schrijver","key":"ref30"},{"key":"ref34","article-title":"An improved bound for minimizing the total weighted completion time of coflows in datacenters","author":"shafiee","year":"2017","journal-title":"ArXiv Preprint"},{"key":"ref10","first-page":"22","article-title":"Mesos: A platform for fine-grained resource sharing in the data center","volume":"11","author":"hindman","year":"2011","journal-title":"NSDI"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591814"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2288973"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/2654822.2541962","article-title":"Ref: Resource elasticity fairness with sharing incentives for multiprocessors","volume":"42","author":"zahedi","year":"2014","journal-title":"ACM SIGARCH Computer Architecture News"},{"journal-title":"Online Computation and Competitive Analysis","year":"2005","author":"borodin","key":"ref14"},{"key":"ref15","first-page":"71","article-title":"New models and algorithms for throughput maximization in broadcast scheduling","volume":"10","author":"chekuri","year":"2010","journal-title":"WAOA"},{"key":"ref16","first-page":"13","article-title":"On scheduling coflows","author":"ahmadi","year":"2017","journal-title":"IPCO"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787480"},{"key":"ref18","first-page":"443","article-title":"Efficient coflow scheduling with varys","author":"chowdhury","year":"2014","journal-title":"SIGCOMM ACM"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2525767"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486187"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2391229.2391241"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/REAL.1992.242650"},{"key":"ref3","first-page":"95","article-title":"Spark: Cluster computing with working sets","volume":"10","author":"zaharia","year":"2010","journal-title":"HotCloud"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.1145\/2694344.2694351","article-title":"Approx-hadoop: Bringing approximations to mapreduce frameworks","author":"goiri","year":"2015","journal-title":"Proc of ASPLOS"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/347476.347479"},{"key":"ref5","article-title":"Grass: Trimming stragglers in approximation analytics","author":"ananthanarayanan","year":"2014","journal-title":"Proc of NSDI"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524430"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CLOUD.2015.47"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref9","first-page":"24","article-title":"Dominant resource fairness: Fair allocation of multiple resource types","volume":"11","author":"ghodsi","year":"2011","journal-title":"NSDI"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2390231.2390237"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218408"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4405"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2233213"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-003-1025-6"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2005.03.005"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2742343"},{"key":"ref25","first-page":"777","article-title":"Preemptive scheduling in overloaded systems","author":"chrobak","year":"2002","journal-title":"Automata Languages and Programming"}],"event":{"name":"IEEE INFOCOM 2018 - IEEE Conference on Computer Communications","start":{"date-parts":[[2018,4,16]]},"location":"Honolulu, HI","end":{"date-parts":[[2018,4,19]]}},"container-title":["IEEE INFOCOM 2018 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8464035\/8485803\/08486323.pdf?arnumber=8486323","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,4]],"date-time":"2022-09-04T06:29:51Z","timestamp":1662272991000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8486323\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/infocom.2018.8486323","relation":{},"subject":[],"published":{"date-parts":[[2018,4]]}}}