{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:43:20Z","timestamp":1743086600123,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319388502"},{"type":"electronic","value":"9783319388519"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-38851-9_18","type":"book-chapter","created":{"date-parts":[[2016,5,31]],"date-time":"2016-05-31T11:33:54Z","timestamp":1464694434000},"page":"262-277","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Experimental Analysis of Algorithms for Coflow Scheduling"],"prefix":"10.1007","author":[{"given":"Zhen","family":"Qiu","sequence":"first","affiliation":[]},{"given":"Clifford","family":"Stein","sequence":"additional","affiliation":[]},{"given":"Yuan","family":"Zhong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,1]]},"reference":[{"key":"18_CR1","unstructured":"Apache hadoop. \n                    http:\/\/hadoop.apache.org"},{"key":"18_CR2","unstructured":"Google dataflow. \n                    https:\/\/www.google.com\/events\/io"},{"issue":"4","key":"18_CR3","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1145\/2534169.2486031","volume":"43","author":"M Alizadeh","year":"2013","unstructured":"Alizadeh, M., Yang, S., Sharif, M., Katti, S., McKeown, N., Prabhakar, B., Shenker, S.: pfabric: Minimal near-optimal datacenter transport. SIGCOMM Comput. Commun. Rev. 43(4), 435\u2013446 (2013)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"issue":"4","key":"18_CR4","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1145\/2043164.2018465","volume":"41","author":"H Ballani","year":"2011","unstructured":"Ballani, H., Costa, P., Karagiannis, T., Rowstron, A.: Towards predictable datacenter networks. SIGCOMM Comput. Commun. Rev. 41(4), 242\u2013253 (2011)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"18_CR5","unstructured":"Borthakur, D.: The hadoop distributed file system: Architecture and design. Hadoop Project Website (2007)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Chowdhury, M., Stoica, I.: Coflow: A networking abstraction for cluster applications. In: HotNets-XI, pp. 31\u201336 (2012)","DOI":"10.1145\/2390231.2390237"},{"issue":"4","key":"18_CR7","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1145\/2043164.2018448","volume":"41","author":"M Chowdhury","year":"2011","unstructured":"Chowdhury, M., Zaharia, M., Ma, J., Jordan, M.I., Stoica, I.: Managing data transfers in computer clusters with orchestra. SIGCOMM Comput. Commun. Rev. 41(4), 98\u2013109 (2011)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Chowdhury, M., Zhong, Y., Stoica, I.: Efficient coflow scheduling with Varys. In: SIGCOMM (2014)","DOI":"10.1145\/2619239.2626315"},{"key":"18_CR9","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: Simplified data processing on large clusters. In: OSDI, p. 10 (2004)"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Dogar, F., Karagiannis, T., Ballani, H., Rowstron, A.: Decentralized task-aware scheduling for data center networks. Technical Report MSR-TR\u201396 2013","DOI":"10.1145\/2619239.2626322"},{"issue":"3","key":"18_CR11","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1287\/moor.22.3.513","volume":"22","author":"LA Hall","year":"1997","unstructured":"Hall, L.A., Schulz, A.S., Shmoys, D.B., Wein, J.: Scheduling to minimize average completion time: Off-line and on-line approximation algorithms. Math. Oper. Res. 22(3), 513\u2013544 (1997)","journal-title":"Math. Oper. Res."},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Kang, N., Liu, Z., Rexford, J., Walker, D.: Optimizing the \u201cone big switch\u201d abstraction in software-defined networks. In: CoNEXT, pp. 13\u201324 (2013)","DOI":"10.1145\/2535372.2535373"},{"issue":"5","key":"18_CR13","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10951-005-2860-x","volume":"8","author":"JY Leung","year":"2005","unstructured":"Leung, J.Y., Li, H., Pinedo, M.: Order scheduling in an environment with dedicated resources in parallel. J. Sched. 8(5), 355\u2013386 (2005)","journal-title":"J. Sched."},{"issue":"1\u20132","key":"18_CR14","first-page":"199","volume":"82","author":"CA Phillips","year":"1998","unstructured":"Phillips, C.A., Stein, C., Wein, J.: Minimizing average completion time in the presence of release dates. Math. Program. 82(1\u20132), 199\u2013223 (1998)","journal-title":"Math. Program."},{"key":"18_CR15","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M Pinedo","year":"2008","unstructured":"Pinedo, M.: Scheduling: Theory, Algorithms, and Systems, 3rd edn. Springer, New York (2008)","edition":"3"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Popa, L., Krishnamurthy, A., Ratnasamy, S., Stoica, I.: Faircloud: Sharing the network in cloud computing. In: HotNets-X, pp. 22:1\u201322:6 (2011)","DOI":"10.1145\/2070562.2070584"},{"key":"18_CR17","unstructured":"Qiu, Z., Stein, C., Zhong, Y.: Experimental analysis of algorithms for coflow scheduling. arXiv (2016). \n                    http:\/\/arxiv.org\/abs\/1603.07981"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Qiu, Z., Stein, C., Zhong, Y.: Minimizing the total weighted completion time of coflows in datacenter networks. In: ACM Symposium on Parallelism in Algorithms and Architectures, pp. 294\u2013303 (2015)","DOI":"10.1145\/2755573.2755592"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Shvachko, K., Kuang, H., Radia, S., Chansler, R.: The hadoop distributed file system. In: MSST, pp. 1\u201310 (2010)","DOI":"10.1109\/MSST.2010.5496972"},{"key":"18_CR20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/11671541_9","volume-title":"Efficient Approximation and Online Algorithms","author":"M Skutella","year":"2006","unstructured":"Skutella, M.: List scheduling in order of \n                    \n                      \n                    \n                    $$\\alpha $$\n                    \n                      \n                        \u03b1\n                      \n                    \n                  -points on a single machine. In: Bampis, E., Jansen, K., Kenyon, C. (eds.) Efficient Approximation and Online Algorithms. LNCS, vol. 3484, pp. 250\u2013291. Springer, Heidelberg (2006)"},{"key":"18_CR21","unstructured":"Zaharia, M., Chowdhury, M., Das, T., Dave, A., Ma, J., McCauley, M., Franklin, M.J., Shenker, S., Stoica, I.: Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing. In: NSDI, p. 2 (2012)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-38851-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:36:18Z","timestamp":1558312578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-38851-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319388502","9783319388519"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-38851-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"1 June 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}