{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T15:28:39Z","timestamp":1759937319971,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2016,6,24]],"date-time":"2016-06-24T00:00:00Z","timestamp":1466726400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["Ci 195\/1- 1"],"award-info":[{"award-number":["Ci 195\/1- 1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001655","name":"German Academic Exchange Service","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001655","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Queueing Syst"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s11134-016-9486-x","type":"journal-article","created":{"date-parts":[[2016,6,24]],"date-time":"2016-06-24T11:50:01Z","timestamp":1466769001000},"page":"261-291","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Stochastic bounds in Fork\u2013Join queueing systems under full and partial mapping"],"prefix":"10.1007","volume":"83","author":[{"given":"Amr","family":"Rizk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felix","family":"Poloczek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florin","family":"Ciucu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,24]]},"reference":[{"key":"9486_CR1","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1287\/opre.43.5.885","volume":"43","author":"J Abate","year":"1995","unstructured":"Abate, J., Choudhury, G.L., Whitt, W.: Exponential approximations for tail probabilities in queues, I: waiting times. Oper. Res. 43, 885\u2013901 (1995)","journal-title":"Oper. Res."},{"key":"9486_CR2","unstructured":"Amazon Elastic Compute Cloud EC2. http:\/\/aws.amazon.com\/ec2"},{"key":"9486_CR3","doi-asserted-by":"crossref","unstructured":"Babu, S.: Towards automatic optimization of MapReduce programs. In: Proceedings of ACM SoCC, pp. 137\u2013142 (2010)","DOI":"10.1145\/1807128.1807150"},{"issue":"3","key":"9486_CR4","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1145\/828.1883","volume":"31","author":"F Baccelli","year":"1984","unstructured":"Baccelli, F., Gelenbe, E., Plateau, B.: An end-to-end approach to the resequencing problem. J. ACM 31(3), 474\u2013485 (1984)","journal-title":"J. ACM"},{"issue":"3","key":"9486_CR5","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1017\/S0001867800018851","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(3), 629\u2013660 (1989)","journal-title":"Adv. Appl. Probab."},{"issue":"10","key":"9486_CR6","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.1109\/71.730531","volume":"9","author":"S Balsamo","year":"1998","unstructured":"Balsamo, S., Donatiello, L., Van Dijk, N.M.: Bound performance models of heterogeneous parallel processing systems. IEEE Trans. Parallel Distrib. Syst. 9(10), 1041\u20131056 (1998)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9486_CR7","volume-title":"Probability and Measure","author":"P Billingsley","year":"1995","unstructured":"Billingsley, P.: Probability and Measure, 3rd edn. Wiley, New York (1995)","edition":"3"},{"key":"9486_CR8","unstructured":"Boxma, O., Koole, G., Liu, Z.: Queueing-theoretic solution methods for models of parallel and distributed systems. In: Proceedings of Performance Evaluation of Parallel and Distributed Systems. CWI Tract 105, pp. 1\u201324 (1994)"},{"issue":"4","key":"9486_CR9","doi-asserted-by":"crossref","first-page":"1049","DOI":"10.1017\/S0021900200099563","volume":"31","author":"E Buffet","year":"1994","unstructured":"Buffet, E., Duffield, N.G.: Exponential upper bounds via martingales for multiplexers with Markovian arrivals. J. Appl. Probab. 31(4), 1049\u20131060 (1994)","journal-title":"J. Appl. Probab."},{"key":"9486_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-0459-9","volume-title":"Performance Guarantees in Communication Networks","author":"CS Chang","year":"2000","unstructured":"Chang, C.S.: Performance Guarantees in Communication Networks. Springer, New York (2000)"},{"issue":"12","key":"9486_CR11","doi-asserted-by":"crossref","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."},{"key":"9486_CR12","doi-asserted-by":"crossref","unstructured":"Ciucu, F., Poloczek, F., Schmitt, J.: Sharp per-flow delay bounds for bursty arrivals: the case of FIFO, SP, and EDF scheduling. In: Proceedings of IEEE INFOCOM, pp. 1896\u20131904 (2014)","DOI":"10.1109\/INFOCOM.2014.6848129"},{"issue":"1","key":"9486_CR13","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM 51(1), 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"issue":"3\u20134","key":"9486_CR14","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/BF01158702","volume":"17","author":"N Duffield","year":"1994","unstructured":"Duffield, N.: Exponential bounds for queues with Markovian arrivals. Queueing Syst. 17(3\u20134), 413\u2013430 (1994)","journal-title":"Queueing Syst."},{"issue":"5","key":"9486_CR15","doi-asserted-by":"crossref","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."},{"key":"9486_CR16","volume-title":"Big Queues. No. 1838 in Lecture Notes in Mathematics","author":"A Ganesh","year":"2004","unstructured":"Ganesh, A., O\u2019Connell, N., Wischik, D.: Big Queues. No. 1838 in Lecture Notes in Mathematics. Springer, New York (2004)"},{"key":"9486_CR17","unstructured":"Gibbens, R.J.: Traffic characterisation and effective bandwidths for broadband network traces. J. R. Stat. Soc. Ser. B. Stat. Methodol. 4, 169\u2013179 (1996)"},{"key":"9486_CR18","doi-asserted-by":"crossref","unstructured":"Han, Y., Makowski, A.: Resequencing delays under multipath routing\u2014asymptotics in a simple queueing model. In: Proceedings of IEEE INFOCOM, pp. 1\u201312 (2006)","DOI":"10.1109\/INFOCOM.2006.158"},{"issue":"2","key":"9486_CR19","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1109\/TSE.1982.234954","volume":"8","author":"G Harrus","year":"1982","unstructured":"Harrus, G., Plateau, B.: Queueing analysis of a reordering issue. IEEE Trans. Softw. Eng. 8(2), 113\u2013123 (1982)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"9486_CR20","volume-title":"Stochastic Network Calculus","author":"Y Jiang","year":"2008","unstructured":"Jiang, Y., Liu, Y.: Stochastic Network Calculus. Springer, New York (2008)"},{"key":"9486_CR21","doi-asserted-by":"crossref","unstructured":"Joshi, G., Liu, Y., Soljanin, E.: Coding for fast content download. In: Proceedings of the Allerton Conference on Communication, Control, and Computing, pp. 326\u2013333 (2012)","DOI":"10.1109\/Allerton.2012.6483236"},{"issue":"5","key":"9486_CR22","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1109\/JSAC.2014.140518","volume":"32","author":"G Joshi","year":"2014","unstructured":"Joshi, G., Liu, Y., Soljanin, E.: On the delay-storage trade-off in content download from coded distributed storage systems. IEEE J. Sel. Areas Commun. 32(5), 989\u2013997 (2014)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"9486_CR23","doi-asserted-by":"crossref","unstructured":"Kandula, S., Sengupta, S., Greenberg, A., Patel, P., Chaiken, R.: The nature of data center traffic: measurements & analysis. In: Proceedings of ACM IMC, pp. 202\u2013208 (2009)","DOI":"10.1145\/1644893.1644918"},{"key":"9486_CR24","doi-asserted-by":"crossref","unstructured":"Kavulya, S., Tan, J., Gandhi, R., Narasimhan, P.: An analysis of traces from a production MapReduce cluster. In: Proceedings of IEEE\/ACM CCGRID, pp. 94\u2013103 (2010)","DOI":"10.1109\/CCGRID.2010.112"},{"issue":"3","key":"9486_CR25","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1007\/s00291-010-0235-y","volume":"34","author":"B Kemper","year":"2012","unstructured":"Kemper, B., Mandjes, M.: Mean sojourn times in two-queue Fork\u2013Join systems: bounds and approximations. OR Spectr. 34(3), 723\u2013742 (2012)","journal-title":"OR Spectr."},{"key":"9486_CR26","doi-asserted-by":"crossref","unstructured":"Kesidis, G., Urgaonkar, B., Shan, Y., Kamarava, S., Liebeherr, J.: Network calculus for parallel processing. In: Proceedings of the ACM MAMA Workshop (2015)","DOI":"10.1145\/2825236.2825256"},{"issue":"1","key":"9486_CR27","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1111\/j.2517-6161.1970.tb00819.x","volume":"32","author":"JFC Kingman","year":"1970","unstructured":"Kingman, J.F.C.: Inequalities in the theory of queues. J. R. Stat. Soc. Ser. B. Stat. Methodol. 32(1), 102\u2013110 (1970)","journal-title":"J. R. Stat. Soc. Ser. B. Stat. Methodol."},{"issue":"5","key":"9486_CR28","doi-asserted-by":"crossref","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. Naval Res. Logist. 55(5), 432\u2013443 (2008)","journal-title":"Naval Res. Logist."},{"key":"9486_CR29","unstructured":"Lebrecht, A.S., Knottenbelt, W.J.: Response time approximations in Fork\u2013Join queues. In: Proceedings of UKPEW (2007)"},{"issue":"2","key":"9486_CR30","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1287\/moor.2015.0740","volume":"41","author":"H Lu","year":"2016","unstructured":"Lu, H., Pang, G.: Gaussian limits for a Fork\u2013Join network with nonexchangeable synchronization in heavy traffic. Math. Oper. Res. 41(2), 560\u2013595 (2016)","journal-title":"Math. Oper. Res."},{"issue":"6","key":"9486_CR31","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1109\/12.2213","volume":"37","author":"R Nelson","year":"1988","unstructured":"Nelson, R., Tantawi, A.: 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":"9486_CR32","first-page":"277","volume":"13","author":"R Pike","year":"2005","unstructured":"Pike, R., Dorward, S., Griesemer, R., Quinlan, S.: Interpreting the data: parallel analysis with Sawzall. Sci. Program. 13(4), 277\u2013298 (2005)","journal-title":"Sci. Program."},{"key":"9486_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jnca.2014.07.022","volume":"46","author":"I Polato","year":"2014","unstructured":"Polato, I., R\u00e9, R., Goldman, A., Kon, F.: A comprehensive view of Hadoop research\u2014a systematic literature review. J. Netw. Comput. Appl. 46, 1\u201325 (2014)","journal-title":"J. Netw. Comput. Appl."},{"key":"9486_CR34","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.peva.2014.07.004","volume":"79","author":"F Poloczek","year":"2014","unstructured":"Poloczek, F., Ciucu, F.: Scheduling analysis with martingales. Perform. Eval. 79, 56\u201372 (2014)","journal-title":"Perform. Eval."},{"issue":"4","key":"9486_CR35","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1145\/2043164.2018467","volume":"41","author":"C Raiciu","year":"2011","unstructured":"Raiciu, C., Barre, S., Pluntke, C., Greenhalgh, A., Wischik, D., Handley, M.: Improving datacenter performance and robustness with multipath TCP. SIGCOMM Comput. Commun. Rev. 41(4), 266\u2013277 (2011)","journal-title":"SIGCOMM Comput. Commun. Rev."},{"issue":"3\u2014-4","key":"9486_CR36","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF02127580","volume":"4","author":"A R\u00e9nyi","year":"1953","unstructured":"R\u00e9nyi, A.: On the theory of order statistics. Acta Math. Hung. 4(3\u2014-4), 191\u2013231 (1953)","journal-title":"Acta Math. Hung."},{"issue":"1","key":"9486_CR37","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/2318857.2254761","volume":"40","author":"J Tan","year":"2012","unstructured":"Tan, J., Meng, X., Zhang, L.: Delay tails in MapReduce scheduling. SIGMETRICS Perform. Eval. Rev. 40(1), 5\u201316 (2012)","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"issue":"1","key":"9486_CR38","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/2637364.2592007","volume":"42","author":"J Tan","year":"2014","unstructured":"Tan, J., Wang, Y., Yu, W., Zhang, L.: Non-work-conserving effects in MapReduce: diffusion limit and criticality. SIGMETRICS Perform. Eval. Rev. 42(1), 181\u2013192 (2014)","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"issue":"1","key":"9486_CR39","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/301464.301484","volume":"27","author":"E Varki","year":"1999","unstructured":"Varki, E.: Mean value technique for closed Fork\u2013Join networks. SIGMETRICS Perform. Eval. Rev. 27(1), 103\u2013112 (1999)","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"issue":"1\u20133","key":"9486_CR40","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0166-5316(94)90016-7","volume":"20","author":"S Varma","year":"1994","unstructured":"Varma, S., Makowski, A.M.: Interpolation approximations for symmetric Fork\u2013Join queues. Perform. Eval. 20(1\u20133), 245\u2013265 (1994)","journal-title":"Perform. Eval."},{"issue":"4","key":"9486_CR41","doi-asserted-by":"crossref","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 Program. 41(4), 495\u2013525 (2013)","journal-title":"Int. J. Parallel Program."},{"key":"9486_CR42","volume-title":"Hadoop: The Definitive Guide","author":"T White","year":"2009","unstructured":"White, T.: Hadoop: The Definitive Guide, 1st edn. O\u2019Reilly Media, Inc., Sebastopol (2009)","edition":"1"},{"issue":"9","key":"9486_CR43","doi-asserted-by":"crossref","first-page":"4107","DOI":"10.1109\/TIT.2008.928234","volume":"54","author":"Y Xia","year":"2008","unstructured":"Xia, Y., Tse, D.: On the large deviation of resequencing queue size: 2-M\/M\/1 case. IEEE Trans. Inf. Theory 54(9), 4107\u20134118 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9486_CR44","unstructured":"Zaharia, M., Konwinski, A., Joseph, A.D., Katz, R., Stoica, I.: Improving MapReduce performance in heterogeneous environments. In: Proceedings of USENIX OSDI, pp. 29\u201342 (2008)"}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-016-9486-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11134-016-9486-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-016-9486-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T21:40:48Z","timestamp":1718660448000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11134-016-9486-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,24]]},"references-count":44,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["9486"],"URL":"https:\/\/doi.org\/10.1007\/s11134-016-9486-x","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"type":"print","value":"0257-0130"},{"type":"electronic","value":"1572-9443"}],"subject":[],"published":{"date-parts":[[2016,6,24]]}}}