{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T13:24:51Z","timestamp":1780320291410,"version":"3.54.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,4,16]],"date-time":"2014-04-16T00:00:00Z","timestamp":1397606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s10479-014-1560-3","type":"journal-article","created":{"date-parts":[[2014,4,15]],"date-time":"2014-04-15T15:02:58Z","timestamp":1397574178000},"page":"569-588","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Controlling variability in split\u2013merge systems and its impact on performance"],"prefix":"10.1007","volume":"239","author":[{"given":"Iryna","family":"Tsimashenka","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"William J.","family":"Knottenbelt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter G.","family":"Harrison","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,4,16]]},"reference":[{"issue":"10","key":"1560_CR1","doi-asserted-by":"crossref","first-page":"2661","DOI":"10.1016\/j.cam.2009.11.013","volume":"223","author":"MM Ali","year":"2010","unstructured":"Ali, M. M., & Gabere, M. N. (2010). A simulated annealing driven multi-start algorithm for bound constrained global optimization. Journal of Computational and Applied Mathematics, 223(10), 2661\u20132674.","journal-title":"Journal of Computational and Applied Mathematics"},{"issue":"3","key":"1560_CR2","doi-asserted-by":"crossref","first-page":"629","DOI":"10.2307\/1427640","volume":"21","author":"F Baccelli","year":"1989","unstructured":"Baccelli, F., Makowski, A. M., & Shwartz, A. (1989). The fork\u2013join queue and related systems with synchronization constraints: Stochastic ordering and computable bounds. Advances in Applied Probability, 21(3), 629\u2013660.","journal-title":"Advances in Applied Probability"},{"issue":"3","key":"1560_CR3","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1145\/65950.65957","volume":"36","author":"F Baccelli","year":"1989","unstructured":"Baccelli, F., Massey, W. A., & Towsley, D. (1989). Acyclic fork\u2013join queuing networks. Journal of the ACM, 36(3), 615\u2013642.","journal-title":"Journal of the ACM"},{"key":"1560_CR4","doi-asserted-by":"crossref","DOI":"10.1002\/0471791571","volume-title":"Queueing networks and Markov chains","author":"G Bolch","year":"2006","unstructured":"Bolch, G., et al. (2006). Queueing networks and Markov chains. Hoboken, NJ: Wiley."},{"key":"1560_CR5","volume-title":"An algorithm with guaranteed convergence for finding a zero of a function. Algorithms for minimization without derivatives, Dover Books on Mathematics","author":"RP Brent","year":"2002","unstructured":"Brent, R. P. (2002). An algorithm with guaranteed convergence for finding a zero of a function. Algorithms for minimization without derivatives, Dover Books on Mathematics. Mineola, NY: Dover Publications."},{"issue":"4","key":"1560_CR6","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1093\/comjnl\/14.4.422","volume":"14","author":"RP Brent","year":"1971","unstructured":"Brent, R. P. (1971). An algorithm with guaranteed convergence for finding a zero of a function. The Computer Journal, 14(4), 422\u2013425.","journal-title":"The Computer Journal"},{"key":"1560_CR7","volume-title":"Numerical methods. Cram101 textbook outlines","author":"EF Burden","year":"2006","unstructured":"Burden, E. F., & Burden, R. L. (2006). Numerical methods. Cram101 textbook outlines (3rd ed.). Ventura, CA: Academic Internet Publishers.","edition":"3"},{"issue":"3","key":"1560_CR8","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1080\/03610929708831947","volume":"26","author":"G Cao","year":"1997","unstructured":"Cao, G., & West, M. (1997). Computing distributions of order statistics. Communications in Statistics, 26(3), 755\u2013764.","journal-title":"Communications in Statistics"},{"key":"1560_CR9","volume-title":"Order statistics. Wiley series in probability and mathematical statistics","author":"HA David","year":"1980","unstructured":"David, H. A. (1980). Order statistics. Wiley series in probability and mathematical statistics. New York: Wiley."},{"key":"1560_CR10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/0471722162.ch5","volume-title":"The non-IID case. Order statistics","author":"HA David","year":"2005","unstructured":"David, H. A., & Nagaraja, H. N. (2005). The non-IID case. Order statistics (3rd ed., pp. 95\u2013120). New York: Wiley.","edition":"3"},{"issue":"5","key":"1560_CR11","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1137\/0145052","volume":"45","author":"L Flatto","year":"1985","unstructured":"Flatto, L. (1985). Two parallel queues created by arrivals with two demands II. SIAM Journal on Applied Mathematics, 45(5), 861\u2013878.","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"5","key":"1560_CR12","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.1137\/0144074","volume":"44","author":"L Flatto","year":"1984","unstructured":"Flatto, L., & Hahn, S. (1984). Two parallel queues created by arrivals with two demands I. SIAM Journal on Applied Mathematics, 44(5), 1041\u20131053.","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"7\u20138","key":"1560_CR13","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1016\/j.peva.2006.11.002","volume":"64","author":"PG Harrison","year":"2007","unstructured":"Harrison, P. G., & Zertal, S. (2007). Queueing models of RAID systems with maxima of waiting times. Performance Evaluation, 64(7\u20138), 664\u2013689.","journal-title":"Performance Evaluation"},{"issue":"1","key":"1560_CR14","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/TC.1983.1676125","volume":"32","author":"P Heidelberger","year":"1983","unstructured":"Heidelberger, P., & Trivedi, K. S. (1983). Analytic queueing models for programs with internal concurrency. IEEE Transactions on Computers, 32(1), 73\u201383.","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"1560_CR15","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1109\/12.16501","volume":"38","author":"C Kim","year":"1989","unstructured":"Kim, C., & Agrawala, A. (1989). Analysis of the fork\u2013join queue. IEEE Transactions on Computers, 38(2), 250\u2013255.","journal-title":"IEEE Transactions on Computers"},{"key":"1560_CR16","unstructured":"Lebrecht, A., & Knottenbelt, W. J. (2007). Response time approximations in fork\u2013join queues. 23rd Annual UK Performance Engineering Workshop (UKPEW)."},{"issue":"5","key":"1560_CR17","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1093\/comjnl\/bxq053","volume":"54","author":"AS Lebrecht","year":"2011","unstructured":"Lebrecht, A. S., Dingle, N. J., & Knottenbelt, W. J. (2011). Analytical and simulation modelling of zoned RAID systems. The Computer Journal, 54(5), 691\u2013707.","journal-title":"The Computer Journal"},{"issue":"6","key":"1560_CR18","doi-asserted-by":"crossref","first-page":"2507","DOI":"10.1137\/050635432","volume":"29","author":"RM Lewis","year":"2007","unstructured":"Lewis, R. M., Shepherd, A., & Torczon, V. (2007). Implementing generating set search methods for linearly constrained minimization. SIAM Journal on Scientfic Computing, 29(6), 2507\u20132530.","journal-title":"SIAM Journal on Scientfic Computing"},{"issue":"4","key":"1560_CR19","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"JA Nelder","year":"1965","unstructured":"Nelder, J. A., & Mead, R. (1965). A simplex method for function minimization. The Computer Journal, 7(4), 308\u2013313.","journal-title":"The Computer Journal"},{"issue":"6","key":"1560_CR20","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1109\/12.2213","volume":"37","author":"R Nelson","year":"1988","unstructured":"Nelson, R., & Tantawi, A. N. (1988). Approximate analysis of fork\/join synchronization in parallel queues. IEEE Transactions on Computers, 37(6), 739\u2013743.","journal-title":"IEEE Transactions on Computers"},{"issue":"6","key":"1560_CR21","doi-asserted-by":"crossref","first-page":"2137","DOI":"10.1214\/aoms\/1177696715","volume":"41","author":"PK Sen","year":"1970","unstructured":"Sen, P. K. (1970). A note on order statistics for heterogeneous distributions. The Annals of Mathematical Statistics, 41(6), 2137\u20132139.","journal-title":"The Annals of Mathematical Statistics"},{"key":"1560_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-89332-5","volume-title":"Basics of applied stochastic processes","author":"R Serfozo","year":"2009","unstructured":"Serfozo, R. (2009). Basics of applied stochastic processes. Berlin: Springer."},{"issue":"11","key":"1560_CR23","doi-asserted-by":"crossref","first-page":"2024","DOI":"10.1109\/TPDS.2012.21","volume":"23","author":"J Sun","year":"2012","unstructured":"Sun, J., & Peterson, G. (2012). An effective execution time approximation method for parallel computing. IEEE Transactions on Parallel and Distributed Systems, 23(11), 2024\u20132032.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"3","key":"1560_CR24","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1109\/71.80157","volume":"1","author":"D Towsley","year":"1990","unstructured":"Towsley, D., Rommel, C. G., & Stankovic, J. A. (1990). Analysis of fork\u2013join program response times on multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 1(3), 286\u2013303.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"1560_CR25","unstructured":"Tsimashenka, I., Knottenbelt, W. (2011). Reduction of variability in split\u2013merge systems. Imperial College Computing Student Workshop (ICCSW 2011), (pp. 101\u2013107)."},{"key":"1560_CR26","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/978-3-642-30782-9_12","volume-title":"Controlling variability in split\u2013merge systems. Analytical and stochastic modeling techniques and applications","author":"I Tsimashenka","year":"2012","unstructured":"Tsimashenka, I., Knottenbelt, W., & Harrison, P. (2012). Controlling variability in split\u2013merge systems. Analytical and stochastic modeling techniques and applications (pp. 165\u2013177). Berlin: Springer."},{"key":"1560_CR27","unstructured":"Varki, E., Merchant, A., Chen, H. The M\/M\/1 fork\u2013join queue with variable sub-tasks (unpublished)."},{"issue":"13","key":"1560_CR28","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. (1994). Interpolation approximations for symmetric fork\u2013join queues. Performance Evaluation, 20(13), 245\u2013265.","journal-title":"Performance Evaluation"},{"key":"1560_CR29","doi-asserted-by":"crossref","unstructured":"Zaharia, M., et al. (2010). Delay scheduling: A simple technique for achieving locality and fairness in cluster scheduling. Proceedings of the 5th European Conference on Computer Systems (EuroSys \u201910), (pp. 265\u2013278).","DOI":"10.1145\/1755913.1755940"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1560-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-014-1560-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1560-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T22:52:46Z","timestamp":1553640766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-014-1560-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,16]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["1560"],"URL":"https:\/\/doi.org\/10.1007\/s10479-014-1560-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,16]]}}}