{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:32:25Z","timestamp":1774679545209,"version":"3.50.1"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2019,1,16]],"date-time":"2019-01-16T00:00:00Z","timestamp":1547596800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,1,16]],"date-time":"2019-01-16T00:00:00Z","timestamp":1547596800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000148","name":"Division of Electrical, Communications and Cyber Systems","doi-asserted-by":"publisher","award":["ECCS-1739189"],"award-info":[{"award-number":["ECCS-1739189"]}],"id":[{"id":"10.13039\/100000148","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000148","name":"Division of Electrical, Communications and Cyber Systems","doi-asserted-by":"publisher","award":["ECCS-1609370"],"award-info":[{"award-number":["ECCS-1609370"]}],"id":[{"id":"10.13039\/100000148","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["XPS-1629444"],"award-info":[{"award-number":["XPS-1629444"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000147","name":"Division of Civil, Mechanical and Manufacturing Innovation","doi-asserted-by":"publisher","award":["CMMI-1538204"],"award-info":[{"award-number":["CMMI-1538204"]}],"id":[{"id":"10.13039\/100000147","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-16-1-0259"],"award-info":[{"award-number":["W911NF-16-1-0259"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007297","name":"Office of Naval Research Global","doi-asserted-by":"publisher","award":["N00014-15-1-2169"],"award-info":[{"award-number":["N00014-15-1-2169"]}],"id":[{"id":"10.13039\/100007297","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000774","name":"Defense Threat Reduction Agency","doi-asserted-by":"publisher","award":["HDTRA1-16-0017"],"award-info":[{"award-number":["HDTRA1-16-0017"]}],"id":[{"id":"10.13039\/100000774","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004318","name":"Microsoft","doi-asserted-by":"publisher","award":["2018 Faculty Award"],"award-info":[{"award-number":["2018 Faculty Award"]}],"id":[{"id":"10.13039\/100004318","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Queueing Syst"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s11134-018-09597-5","type":"journal-article","created":{"date-parts":[[2019,1,16]],"date-time":"2019-01-16T09:58:46Z","timestamp":1547632726000},"page":"207-239","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Delay asymptotics and bounds for multitask parallel jobs"],"prefix":"10.1007","volume":"91","author":[{"given":"Weina","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mor","family":"Harchol-Balter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haotian","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Scheller-Wolf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Srikant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,16]]},"reference":[{"key":"9597_CR1","unstructured":"Baccelli, F.: Two parallel queues created by arrivals with two demands: the M\/G\/2 symmetrical case. Technical Report RR-0426, INRIA (1985)"},{"key":"9597_CR2","unstructured":"Baccelli, F., Makowski, A.M.: Simple computable bounds for the fork\u2013join queue. Technical Report RR-0394, INRIA (1985)"},{"key":"9597_CR3","doi-asserted-by":"publisher","first-page":"629","DOI":"10.2307\/1427640","volume":"21","author":"F Baccelli","year":"1989","unstructured":"Baccelli, F., Makowski, A.M., Shwartz, A.: The fork\u2013join queue and related systems with synchronization constraints: stochastic ordering and computable bounds. Adv. Appl. Probab. 21, 629\u2013660 (1989)","journal-title":"Adv. Appl. Probab."},{"issue":"3","key":"9597_CR4","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s11134-012-9311-0","volume":"71","author":"M Bramson","year":"2012","unstructured":"Bramson, M., Lu, Y., Prabhakar, B.: Asymptotic independence of queues under randomized load balancing. Queueing Syst. 71(3), 247\u2013292 (2012)","journal-title":"Queueing Syst."},{"issue":"12","key":"9597_CR5","doi-asserted-by":"publisher","first-page":"1802","DOI":"10.14778\/2367502.2367519","volume":"5","author":"Y Chen","year":"2012","unstructured":"Chen, Y., Alspaugh, S., Katz, R.: Interactive analytical processing in big data systems: a cross-industry study of MapReduce workloads. Proc. VLDB Endow. 5(12), 1802\u20131813 (2012)","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"9597_CR6","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1214\/aop\/1176993391","volume":"12","author":"JT Cox","year":"1984","unstructured":"Cox, J.T.: An alternate proof of a correlation inequality of Harris. Ann. Probab. 12(1), 272\u2013273 (1984)","journal-title":"Ann. Probab."},{"key":"9597_CR7","volume-title":"Asymptotic Theory of Statistics and Probability","author":"A DasGupta","year":"2008","unstructured":"DasGupta, A.: Asymptotic Theory of Statistics and Probability. Springer, Berlin (2008)"},{"key":"9597_CR8","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. In: Proceedings of the USENIX Conference Operating Systems Design and Implementation (OSDI), San Francisco, CA, pp. 10\u201310 (2004)"},{"issue":"5","key":"9597_CR9","doi-asserted-by":"publisher","first-page":"1466","DOI":"10.1214\/aoms\/1177698701","volume":"38","author":"JD Esary","year":"1967","unstructured":"Esary, J.D., Proschan, F., Walkup, D.W.: Association of random variables, with applications. Ann. Math. Stat. 38(5), 1466\u20131474 (1967)","journal-title":"Ann. Math. Stat."},{"key":"9597_CR10","unstructured":"Farhat, F., Tootaghaj, D., He, Y., Sivasubramaniam, A., Kandemir, M., Das, C.: Stochastic modeling and optimization of stragglers. IEEE Trans. Cloud Comput. (2016) (to be published)"},{"issue":"5","key":"9597_CR11","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1137\/0144074","volume":"44","author":"L Flatto","year":"1984","unstructured":"Flatto, L., Hahn, S.: Two parallel queues created by arrivals with two demands I. SIAM J. Appl. Math. 44(5), 1041\u20131053 (1984)","journal-title":"SIAM J. Appl. Math."},{"issue":"2","key":"9597_CR12","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF01651330","volume":"22","author":"CM Fortuin","year":"1971","unstructured":"Fortuin, C.M., Kasteleyn, P.W., Ginibre, J.: Correlation inequalities on some partially ordered sets. Commun. Math. Phys. 22(2), 89\u2013103 (1971)","journal-title":"Commun. Math. Phys."},{"key":"9597_CR13","doi-asserted-by":"crossref","unstructured":"Gardner, K., Harchol-Balter, M., Scheller-Wolf, A.: A better model for job redundancy: decoupling server slowdown and job size. In: IEEE International Symposium Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS), London, United Kingdom, pp. 1\u201310 (2016)","DOI":"10.1109\/MASCOTS.2016.43"},{"issue":"6","key":"9597_CR14","doi-asserted-by":"publisher","first-page":"3353","DOI":"10.1109\/TNET.2017.2744607","volume":"25","author":"K Gardner","year":"2017","unstructured":"Gardner, K., Harchol-Balter, M., Scheller-Wolf, A., Van Houdt, B.: A better model for job redundancy: decoupling server slowdown and job size. IEEE\/ACM Trans. Netw. 25(6), 3353\u20133367 (2017a)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"4","key":"9597_CR15","doi-asserted-by":"publisher","first-page":"1078","DOI":"10.1287\/opre.2016.1582","volume":"65","author":"K Gardner","year":"2017","unstructured":"Gardner, K., Harchol-Balter, M., Scheller-Wolf, A., Velednitsky, M., Zbarsky, S.: Redundancy-d: the power of d choices for redundancy. Oper. Res. 65(4), 1078\u20131094 (2017b)","journal-title":"Oper. Res."},{"issue":"1","key":"9597_CR16","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1017\/S0021900200015345","volume":"37","author":"C Graham","year":"2000","unstructured":"Graham, C.: Chaoticity on path space for a queueing network with selection of the shortest queue among several. J. Appl. Probab. 37(1), 198\u2013211 (2000)","journal-title":"J. Appl. Probab."},{"issue":"1","key":"9597_CR17","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0304-4149(93)90043-4","volume":"44","author":"C Graham","year":"1993","unstructured":"Graham, C., M\u00e9l\u00e9ard, S.: Propagation of chaos for a fully connected loss network with alternate routing. Stoch. Proc. Appl. 44(1), 159\u2013180 (1993)","journal-title":"Stoch. Proc. Appl."},{"key":"9597_CR18","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139226424","volume-title":"Performance Modeling and Design of Computer Systems: Queueing Theory in Action","author":"M Harchol-Balter","year":"2013","unstructured":"Harchol-Balter, M.: Performance Modeling and Design of Computer Systems: Queueing Theory in Action, 1st edn. Cambridge University Press, New York (2013)","edition":"1"},{"issue":"3","key":"9597_CR19","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1214\/aop\/1176995804","volume":"5","author":"TE Harris","year":"1977","unstructured":"Harris, T.E.: A correlation inequality for Markov processes in partially ordered state spaces. Ann. Probab. 5(3), 451\u2013454 (1977)","journal-title":"Ann. Probab."},{"issue":"1","key":"9597_CR20","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1214\/aos\/1176346079","volume":"11","author":"K Joag-Dev","year":"1983","unstructured":"Joag-Dev, K., Proschan, F.: Negative association of random variables with applications. Ann. Stat. 11(1), 286\u2013295 (1983)","journal-title":"Ann. Stat."},{"key":"9597_CR21","doi-asserted-by":"crossref","unstructured":"Joshi, G., Liu, Y., Soljanin, E.: Coding for fast content download. In: Proceedings of the Annual Allerton Conference on Communication, Control and Computing, Monticello, IL, pp. 326\u2013333 (2012)","DOI":"10.1109\/Allerton.2012.6483236"},{"issue":"2","key":"9597_CR22","doi-asserted-by":"publisher","first-page":"12:1","DOI":"10.1145\/3055281","volume":"2","author":"G Joshi","year":"2017","unstructured":"Joshi, G., Soljanin, E., Wornell, G.: Efficient redundancy techniques for latency reduction in cloud systems. ACM Trans. Model. Perform. Eval. Comput. Syst. 2(2), 12:1\u201312:30 (2017)","journal-title":"ACM Trans. Model. Perform. Eval. Comput. Syst."},{"issue":"5","key":"9597_CR23","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1002\/nav.20294","volume":"55","author":"SS Ko","year":"2008","unstructured":"Ko, S.S., Serfozo, R.F.: Sojourn times in G\/M\/1 fork\u2013join networks. Nav. Res. Log. 55(5), 432\u2013443 (2008)","journal-title":"Nav. Res. Log."},{"issue":"10","key":"9597_CR24","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1109\/71.246075","volume":"4","author":"A Kumar","year":"1993","unstructured":"Kumar, A., Shorey, R.: Performance analysis and scheduling of stochastic fork-join jobs in a multicomputer system. IEEE Trans. Parallel Distrib. Syst. 4(10), 1147\u20131164 (1993)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"5","key":"9597_CR25","first-page":"2822","volume":"63","author":"K Lee","year":"2017","unstructured":"Lee, K., Shah, N.B., Huang, L., Ramchandran, K.: The MDS queue: analysing the latency performance of erasure codes. IEEE Trans. Inf. Theory 63(5), 2822\u20132842 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9597_CR26","doi-asserted-by":"crossref","unstructured":"Li, B., Ramamoorthy, A., Srikant, R.: Mean-field-analysis of coding versus replication in cloud storage systems. In: Proceedings IEEE International Conference on Computer Communications (INFOCOM), San Francisco, CA, pp. 1\u20139 (2016)","DOI":"10.1109\/INFOCOM.2016.7524626"},{"key":"9597_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/b138374","volume-title":"Interacting Particle Systems","author":"TM Liggett","year":"2005","unstructured":"Liggett, T.M.: Interacting Particle Systems. Springer, Berlin (2005)"},{"issue":"10","key":"9597_CR28","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1016\/j.peva.2013.08.013","volume":"70","author":"M Lin","year":"2013","unstructured":"Lin, M., Zhang, L., Wierman, A., Tan, J.: Joint optimization of overlapping phases in MapReduce. Perform. Eval. 70(10), 720\u2013735 (2013)","journal-title":"Perform. Eval."},{"issue":"1","key":"9597_CR29","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s11134-016-9505-y","volume":"85","author":"H Lu","year":"2017","unstructured":"Lu, H., Pang, G.: Heavy-traffic limits for an infinite-server fork\u2013join queueing system with dependent and disruptive services. Queueing Syst. 85(1), 67\u2013115 (2017)","journal-title":"Queueing Syst."},{"issue":"3","key":"9597_CR30","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1109\/71.674321","volume":"9","author":"JC Lui","year":"1998","unstructured":"Lui, J.C., Muntz, R.R., Towsley, D.: Computing performance bounds of fork\u2013join parallel programs under a multiprocessing environment. IEEE Trans. Parallel Distrib. Syst. 9(3), 295\u2013311 (1998)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"9597_CR31","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1287\/opre.38.1.156","volume":"38","author":"B Melamed","year":"1990","unstructured":"Melamed, B., Whitt, W.: On arrivals that see time averages. Oper. Res. 38(1), 156\u2013172 (1990)","journal-title":"Oper. Res."},{"issue":"3","key":"9597_CR32","doi-asserted-by":"publisher","first-page":"542","DOI":"10.2307\/1427479","volume":"24","author":"SP Meyn","year":"1992","unstructured":"Meyn, S.P., Tweedie, R.L.: Stability of Markovian processes I: criteria for discrete-time chains. Adv. Appl. Probab. 24(3), 542\u2013574 (1992)","journal-title":"Adv. Appl. Probab."},{"issue":"3","key":"9597_CR33","doi-asserted-by":"publisher","first-page":"518","DOI":"10.2307\/1427522","volume":"25","author":"SP Meyn","year":"1993","unstructured":"Meyn, S.P., Tweedie, R.L.: Stability of Markovian processes III: Foster\u2013Lyapunov criteria for continuous-time processes. Adv. Appl. Probab. 25(3), 518\u2013548 (1993)","journal-title":"Adv. Appl. Probab."},{"key":"9597_CR34","doi-asserted-by":"crossref","unstructured":"Moseley, B., Dasgupta, A., Kumar, R., Sarl\u00f3s, T.: On scheduling in map-reduce and flow-shops. In: Proceedings of the Annual ACM Symposium Parallelism in Algorithms and Architectures (SPAA), San Jose, CA, pp. 289\u2013298 (2011)","DOI":"10.1145\/1989493.1989540"},{"issue":"6","key":"9597_CR35","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1109\/12.2213","volume":"37","author":"R Nelson","year":"1988","unstructured":"Nelson, R., Tantawi, A.N.: Approximate analysis of fork\/join synchronization in parallel queues. IEEE Trans. Comput. 37(6), 739\u2013743 (1988)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"9597_CR36","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1109\/32.4676","volume":"14","author":"R Nelson","year":"1988","unstructured":"Nelson, R., Towsley, D., Tantawi, A.N.: Performance analysis of parallel processing systems. IEEE Trans. Softw. Eng. 14(4), 532\u2013540 (1988)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"3","key":"9597_CR37","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s11134-016-9486-x","volume":"83","author":"A Rizk","year":"2016","unstructured":"Rizk, A., Poloczek, F., Ciucu, F.: Stochastic bounds in fork\u2013join queueing systems under full and partial mapping. Queueing Syst. 83(3), 261\u2013291 (2016)","journal-title":"Queueing Syst."},{"key":"9597_CR38","volume-title":"Real Analysis","author":"HL Royden","year":"2010","unstructured":"Royden, H.L., Fitzpatrick, P.M.: Real Analysis, 4th edn. Pearson, London (2010)","edition":"4"},{"key":"9597_CR39","doi-asserted-by":"crossref","unstructured":"Shah, N.B., Lee, K., Ramchandran, K.: When do redundant requests reduce latency? In: Proceedings of the Annual Allerton Conference on Communication, Control and Computing, Monticello, IL, pp. 731\u2013738 (2013)","DOI":"10.1109\/Allerton.2013.6736597"},{"key":"9597_CR40","doi-asserted-by":"crossref","unstructured":"Shah, V., Bouillard, A., Baccelli, F.: Delay comparison of delivery and coding policies in data clusters. In: Proceedings of the Annual Allerton Conference on Communication, Control and Computing, Monticello, IL, pp. 397\u2013404 (2017)","DOI":"10.1109\/ALLERTON.2017.8262765"},{"key":"9597_CR41","unstructured":"Sun, Y., Koksal, C.E., Shroff, N.B.: Near delay-optimal scheduling of batch jobs in multi-server systems. The Ohio State University. Technical Report (2017)"},{"key":"9597_CR42","doi-asserted-by":"crossref","unstructured":"Tan, J., Meng, X., Zhang, L.: Delay tails in MapReduce scheduling. In: Proceedings of the ACM SIGMETRICS\/PERFORMANCE Jt. International Conference on Measurement and Modeling of Computer Systems, London, United Kingdom, pp. 5\u201316 (2012)","DOI":"10.1145\/2254756.2254761"},{"issue":"2","key":"9597_CR43","doi-asserted-by":"publisher","first-page":"17:1","DOI":"10.1145\/2628913","volume":"47","author":"A Thomasian","year":"2014","unstructured":"Thomasian, A.: Analysis of fork\/join and related queueing systems. ACM Comput. Surv. 47(2), 17:1\u201317:71 (2014)","journal-title":"ACM Comput. Surv."},{"issue":"11","key":"9597_CR44","doi-asserted-by":"publisher","first-page":"1146","DOI":"10.1109\/71.969125","volume":"12","author":"E Varki","year":"2001","unstructured":"Varki, E.: Response time analysis of parallel computer and storage systems. IEEE Trans. Parallel Distrib. Syst. 12(11), 1146\u20131161 (2001)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"4","key":"9597_CR45","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10766-012-0227-4","volume":"41","author":"E Vianna","year":"2013","unstructured":"Vianna, E., Comarela, G., Pontes, T., Almeida, J., Almeida, V., Wilkinson, K., Kuno, H., Dayal, U.: Analytical performance models for MapReduce workloads. Int. J. Parallel Prog. 41(4), 495\u2013525 (2013)","journal-title":"Int. J. Parallel Prog."},{"key":"9597_CR46","doi-asserted-by":"crossref","unstructured":"Vulimiri, A., Michel, O., Godfrey, P.B., Shenker, S.: More is less: reducing latency via redundancy. In: Proceedings of the ACM Workshop Hot Topics in Networks (HotNets), Redmond, WA, pp. 13\u201318 (2012)","DOI":"10.1145\/2390231.2390234"},{"key":"9597_CR47","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1109\/TNET.2014.2362745","volume":"24","author":"W Wang","year":"2016","unstructured":"Wang, W., Zhu, K., Ying, L., Tan, J., Zhang, L.: MapTask scheduling in MapReduce with data locality: throughput and heavy-traffic optimality. IEEE\/ACM Trans. Netw. 24, 190\u2013203 (2016)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9597_CR48","doi-asserted-by":"crossref","unstructured":"Xia, C.H., Liu, Z., Towsley, D., Lelarge, M.: Scalability of fork\/join queueing networks with blocking. In: Proceedings of the ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, San Diego, CA, pp. 133\u2013144 (2007)","DOI":"10.1145\/1269899.1254898"},{"issue":"4","key":"9597_CR49","doi-asserted-by":"publisher","first-page":"2443","DOI":"10.1109\/TNET.2015.2466453","volume":"24","author":"Y Xiang","year":"2016","unstructured":"Xiang, Y., Lan, T., Aggarwal, V., Chen, Y.F.R.: Joint latency and cost optimization for erasure-coded data center storage. IEEE\/ACM Trans. Netw. 24(4), 2443\u20132457 (2016)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9597_CR50","doi-asserted-by":"crossref","unstructured":"Xie, Q., Lu, Y.: Priority algorithm for near-data scheduling: throughput and heavy-traffic optimality. In: Proceedings of the IEEE International Conference on Computer Communications (INFOCOM), Hong Kong, China, pp. 963\u2013972 (2015)","DOI":"10.1109\/INFOCOM.2015.7218468"},{"key":"9597_CR51","doi-asserted-by":"crossref","unstructured":"Xie, Q., Dong, X., Lu, Y., Srikant, R.: Power of d choices for large-scale bin packing: a loss model. In: Proceedings of the ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, Portland, OR, pp. 321\u2013334 (2015)","DOI":"10.1145\/2796314.2745849"},{"key":"9597_CR52","doi-asserted-by":"crossref","unstructured":"Ying, L., Srikant, R., Kang, X.: The power of slightly more than one sample in randomized load balancing. In: Proceedings of the IEEE International Conference on Computer Communications (INFOCOM), Kowloon, Hong Kong, pp. 1131\u20131139 (2015)","DOI":"10.1109\/INFOCOM.2015.7218487"},{"key":"9597_CR53","doi-asserted-by":"crossref","unstructured":"Zheng, Y., Shroff, N.B., Sinha, P.: A new analytical technique for designing provably efficient MapReduce schedulers. In: Proceedings of the IEEE International Conference on Computer Communications (INFOCOM), Turin, Italy, pp. 1600\u20131608 (2013)","DOI":"10.1109\/INFCOM.2013.6566956"}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11134-018-09597-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-018-09597-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-018-09597-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,10]],"date-time":"2022-09-10T10:39:35Z","timestamp":1662806375000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11134-018-09597-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,16]]},"references-count":53,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["9597"],"URL":"https:\/\/doi.org\/10.1007\/s11134-018-09597-5","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,16]]},"assertion":[{"value":"10 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}