Fork–join queue (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Fork–join queue" in English language version.

Last modified: 11:00:38, 24 January 2026 (UTC)

Ref.Un. Ref.Website

Global rank English rank

2720doi.org

2^nd place

109semanticscholar.org

15^th place

8^th place

54adsabs.harvard.edu

14^th place

9^th place

53web.archive.org

1^st place

42ic.ac.uk

low place

22jstor.org

23^rd place

15^th place

22psu.edu

299^th place

159^th place

22arxiv.org

49^th place

31^st place

11cwi.nl

low place

11uu.se

3,445^th place

3,148^th place

11unh.edu

3,525^th place

2,985^th place

11inria.fr

6,372^nd place

5,582^nd place

11umd.edu

1,356^th place

1,172^nd place

11technion.ac.il

low place

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

ui.adsabs.harvard.edu

Kim, C.; Agrawala, A. K. (1989). "Analysis of the fork-join queue". IEEE Transactions on Computers. 38 (2): 250. Bibcode:1989ITCmp..38..250K. doi:10.1109/12.16501.
Nelson, R.; Tantawi, A. N. (1988). "Approximate analysis of fork/join synchronization in parallel queues". IEEE Transactions on Computers. 37 (6): 739. Bibcode:1988ITCmp..37..739N. doi:10.1109/12.2213.
Joshi, Gauri; Liu, Yanpei; Soljanin, Emina (October 2012). Coding for Fast Content Download. Allerton Conference on Communication, Control and Computing. arXiv:1210.3012. Bibcode:2012arXiv1210.3012J.
Joshi, Gauri; Liu, Yanpei; Soljanin, Emina (May 2014). On the Delay-Storage trade-off in Content Download from Coded Distributed Storage. Journal on Selected Areas of Communications. arXiv:1305.3945. Bibcode:2013arXiv1305.3945J.

arxiv.org (Global: 49^th place; English: 31^st place)

Joshi, Gauri; Liu, Yanpei; Soljanin, Emina (October 2012). Coding for Fast Content Download. Allerton Conference on Communication, Control and Computing. arXiv:1210.3012. Bibcode:2012arXiv1210.3012J.
Joshi, Gauri; Liu, Yanpei; Soljanin, Emina (May 2014). On the Delay-Storage trade-off in Content Download from Coded Distributed Storage. Journal on Selected Areas of Communications. arXiv:1305.3945. Bibcode:2013arXiv1305.3945J.

cwi.nl (Global: low place; English: low place)

oai.cwi.nl

Boxma, Onno; Koole, Ger; Liu, Zhen (1996). Queueing-theoretic Solution Methods for Models of Parallel and Distributed Systems (PDF) (Technical report). CWI. BS-R9425.

doi.org (Global: 2^nd place; English: 2^nd place)

Kim, C.; Agrawala, A. K. (1989). "Analysis of the fork-join queue". IEEE Transactions on Computers. 38 (2): 250. Bibcode:1989ITCmp..38..250K. doi:10.1109/12.16501.
Serfozo, R. (2009). "Markov Chains". Basics of Applied Stochastic Processes. Probability and Its Applications. pp. 1–98. doi:10.1007/978-3-540-89332-5_1. ISBN 978-3-540-89331-8.
Flatto, L.; Hahn, S. (1984). "Two Parallel Queues Created by Arrivals with Two Demands I". SIAM Journal on Applied Mathematics. 44 (5): 1041. doi:10.1137/0144074.
Wright, Paul E. (1992), "Two parallel processors with coupled inputs", Advances in Applied Probability, 24 (4): 986–1007, doi:10.2307/1427722, JSTOR 1427722, S2CID 124774848
Pinotsi, D.; Zazanis, M. A. (2005). "Synchronized queues with deterministic arrivals". Operations Research Letters. 33 (6): 560. doi:10.1016/j.orl.2004.12.005.
Konstantopoulos, Panagiotis; Walrand, Jean (September 1989). "Stationary and Stability of Fork-Join Networks" (PDF). Journal of Applied Probability. 26 (3): 604–614. doi:10.2307/3214417. JSTOR 3214417. S2CID 120222029. Archived from the original (PDF) on 18 March 2012.
Lebrecht, A. S.; Dingle, N. J.; Knottenbelt, W. J. (2009). "Modelling Zoned RAID Systems Using Fork-Join Queueing Simulation". Computer Performance Engineering. Lecture Notes in Computer Science. Vol. 5652. pp. 16–29. CiteSeerX 10.1.1.158.7363. doi:10.1007/978-3-642-02924-0_2. ISBN 978-3-642-02923-3. {{cite book}}: Cite uses deprecated parameter |citeseerx= (help)
Kemper, B.; Mandjes, M. (2011). "Mean sojourn times in two-queue fork-join systems: Bounds and approximations". OR Spectrum. 34 (3): 723. doi:10.1007/s00291-010-0235-y.
Ko, S. S.; Serfozo, R. F. (2004). "Response times in M/M/s fork-join networks". Advances in Applied Probability. 36 (3): 854. doi:10.1239/aap/1093962238. S2CID 122581916.
Ko, S. S.; Serfozo, R. F. (2008). "Sojourn times in G/M/1 fork-join networks". Naval Research Logistics. 55 (5): 432. doi:10.1002/nav.20294. S2CID 119551482.
Qiu, Zhan; Pérez, Juan F.; Harrison, Peter G. (2015). "Beyond the mean in fork-join queues: Efficient approximation for response-time tails". Performance Evaluation. 91: 99–116. doi:10.1016/j.peva.2015.06.007.
Nelson, R.; Tantawi, A. N. (1988). "Approximate analysis of fork/join synchronization in parallel queues". IEEE Transactions on Computers. 37 (6): 739. Bibcode:1988ITCmp..37..739N. doi:10.1109/12.2213.
Alomari, F.; Menasce, D. A. (2013). "Efficient Response Time Approximations for Multiclass Fork and Join Queues in Open and Closed Queuing Networks". IEEE Transactions on Parallel and Distributed Systems. 25 (6): 1437–1446. doi:10.1109/TPDS.2013.70. S2CID 422296.
Tsimashenka, I.; Knottenbelt, W. J. (2013). "Reduction of Subtask Dispersion in Fork-Join Systems" (PDF). Computer Performance Engineering. Lecture Notes in Computer Science. Vol. 8168. pp. 325–336. CiteSeerX 10.1.1.421.9780. doi:10.1007/978-3-642-40725-3_25. ISBN 978-3-642-40724-6. {{cite book}}: Cite uses deprecated parameter |citeseerx= (help)
Tan, X.; Knessl, C. (1996). "A fork-join queueing model: Diffusion approximation, integral representations and asymptotics". Queueing Systems. 22 (3–4): 287. doi:10.1007/BF01149176. S2CID 206789463.
Atar, R.; Mandelbaum, A.; Zviran, A. (2012). "Control of Fork-Join Networks in heavy traffic" (PDF). 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton). p. 823. doi:10.1109/Allerton.2012.6483303. ISBN 978-1-4673-4539-2. S2CID 18115820.
Li, J.; Zhao, Y. Q. (2010). "On the Probability Distribution of Join Queue Length in a Fork-Join Model". Probability in the Engineering and Informational Sciences. 24 (4): 473. doi:10.1017/S0269964810000112. S2CID 124693767.
Ko, S. S. (2007). "Cycle Times in a Serial Fork-Join Network". Computational Science and Its Applications – ICCSA 2007. Lecture Notes in Computer Science. Vol. 4705. pp. 758–766. doi:10.1007/978-3-540-74472-6_62. ISBN 978-3-540-74468-9.
Harrison, P.; Zertal, S. (2003). "Queueing Models with Maxima of Service Times". Computer Performance Evaluation. Modelling Techniques and Tools. Lecture Notes in Computer Science. Vol. 2794. pp. 152–168. doi:10.1007/978-3-540-45232-4_10. ISBN 978-3-540-40814-7.
Fiorini, Pierre M. (2015). "Exact Analysis of Some Split Merge Queues". SIGMETRICS Performance Evaluation Review. 43 (2): 51–53. doi:10.1145/2825236.2825257. S2CID 26219594.

ic.ac.uk (Global: low place; English: low place)

pubs.doc.ic.ac.uk

Lebrecht, Abigail; Knottenbelt, William J. (June 2007). Response Time Approximations in Fork-Join Queues (PDF). 23rd Annual UK Performance Engineering Workshop (UKPEW). Archived from the original (PDF) on 29 October 2013. Retrieved 2 July 2009.

doc.ic.ac.uk

Tsimashenka, I.; Knottenbelt, W. J. (2013). "Reduction of Subtask Dispersion in Fork-Join Systems" (PDF). Computer Performance Engineering. Lecture Notes in Computer Science. Vol. 8168. pp. 325–336. CiteSeerX 10.1.1.421.9780. doi:10.1007/978-3-642-40725-3_25. ISBN 978-3-642-40724-6. {{cite book}}: Cite uses deprecated parameter |citeseerx= (help)

inria.fr (Global: 6,372^nd place; English: 5,582^nd place)

hal.inria.fr

Baccelli, François; Makowski, A. (1985), Simple computable bounds for the fork-join queue (PDF), National Institute for Research in Computer Science and Control Technical Report, retrieved 8 July 2011

jstor.org (Global: 23^rd place; English: 15^th place)

Wright, Paul E. (1992), "Two parallel processors with coupled inputs", Advances in Applied Probability, 24 (4): 986–1007, doi:10.2307/1427722, JSTOR 1427722, S2CID 124774848
Konstantopoulos, Panagiotis; Walrand, Jean (September 1989). "Stationary and Stability of Fork-Join Networks" (PDF). Journal of Applied Probability. 26 (3): 604–614. doi:10.2307/3214417. JSTOR 3214417. S2CID 120222029. Archived from the original (PDF) on 18 March 2012.

psu.edu (Global: 299^th place; English: 159^th place)

citeseerx.ist.psu.edu

Lebrecht, A. S.; Dingle, N. J.; Knottenbelt, W. J. (2009). "Modelling Zoned RAID Systems Using Fork-Join Queueing Simulation". Computer Performance Engineering. Lecture Notes in Computer Science. Vol. 5652. pp. 16–29. CiteSeerX 10.1.1.158.7363. doi:10.1007/978-3-642-02924-0_2. ISBN 978-3-642-02923-3. {{cite book}}: Cite uses deprecated parameter |citeseerx= (help)
Tsimashenka, I.; Knottenbelt, W. J. (2013). "Reduction of Subtask Dispersion in Fork-Join Systems" (PDF). Computer Performance Engineering. Lecture Notes in Computer Science. Vol. 8168. pp. 325–336. CiteSeerX 10.1.1.421.9780. doi:10.1007/978-3-642-40725-3_25. ISBN 978-3-642-40724-6. {{cite book}}: Cite uses deprecated parameter |citeseerx= (help)

semanticscholar.org (Global: 15^th place; English: 8^th place)

api.semanticscholar.org

Wright, Paul E. (1992), "Two parallel processors with coupled inputs", Advances in Applied Probability, 24 (4): 986–1007, doi:10.2307/1427722, JSTOR 1427722, S2CID 124774848
Konstantopoulos, Panagiotis; Walrand, Jean (September 1989). "Stationary and Stability of Fork-Join Networks" (PDF). Journal of Applied Probability. 26 (3): 604–614. doi:10.2307/3214417. JSTOR 3214417. S2CID 120222029. Archived from the original (PDF) on 18 March 2012.
Ko, S. S.; Serfozo, R. F. (2004). "Response times in M/M/s fork-join networks". Advances in Applied Probability. 36 (3): 854. doi:10.1239/aap/1093962238. S2CID 122581916.
Ko, S. S.; Serfozo, R. F. (2008). "Sojourn times in G/M/1 fork-join networks". Naval Research Logistics. 55 (5): 432. doi:10.1002/nav.20294. S2CID 119551482.
Alomari, F.; Menasce, D. A. (2013). "Efficient Response Time Approximations for Multiclass Fork and Join Queues in Open and Closed Queuing Networks". IEEE Transactions on Parallel and Distributed Systems. 25 (6): 1437–1446. doi:10.1109/TPDS.2013.70. S2CID 422296.
Tan, X.; Knessl, C. (1996). "A fork-join queueing model: Diffusion approximation, integral representations and asymptotics". Queueing Systems. 22 (3–4): 287. doi:10.1007/BF01149176. S2CID 206789463.
Atar, R.; Mandelbaum, A.; Zviran, A. (2012). "Control of Fork-Join Networks in heavy traffic" (PDF). 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton). p. 823. doi:10.1109/Allerton.2012.6483303. ISBN 978-1-4673-4539-2. S2CID 18115820.
Li, J.; Zhao, Y. Q. (2010). "On the Probability Distribution of Join Queue Length in a Fork-Join Model". Probability in the Engineering and Informational Sciences. 24 (4): 473. doi:10.1017/S0269964810000112. S2CID 124693767.
Fiorini, Pierre M. (2015). "Exact Analysis of Some Split Merge Queues". SIGMETRICS Performance Evaluation Review. 43 (2): 51–53. doi:10.1145/2825236.2825257. S2CID 26219594.

technion.ac.il (Global: low place; English: low place)

webee.technion.ac.il

Atar, R.; Mandelbaum, A.; Zviran, A. (2012). "Control of Fork-Join Networks in heavy traffic" (PDF). 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton). p. 823. doi:10.1109/Allerton.2012.6483303. ISBN 978-1-4673-4539-2. S2CID 18115820.

umd.edu (Global: 1,356^th place; English: 1,172^nd place)

drum.lib.umd.edu

Varma, Subir (1990). "Heavy and Light Traffic Approximations for Queues with Synchronization Constraints (PhD thesis)" (PDF). University of Maryland. Retrieved 10 February 2013.

unh.edu (Global: 3,525^th place; English: 2,985^th place)

cs.unh.edu

Varki, Elizabeth; Merchant, Arif; Chen, H. "M/M/1 Fork-join queue with variable sub-tasks" (PDF). Archived from the original (PDF) on 5 August 2010. Retrieved 29 March 2009.

uu.se (Global: 3,445^th place; English: 3,148^th place)

www2.math.uu.se

Konstantopoulos, Panagiotis; Walrand, Jean (September 1989). "Stationary and Stability of Fork-Join Networks" (PDF). Journal of Applied Probability. 26 (3): 604–614. doi:10.2307/3214417. JSTOR 3214417. S2CID 120222029. Archived from the original (PDF) on 18 March 2012.

web.archive.org (Global: 1^st place; English: 1^st place)

Lebrecht, Abigail; Knottenbelt, William J. (June 2007). Response Time Approximations in Fork-Join Queues (PDF). 23rd Annual UK Performance Engineering Workshop (UKPEW). Archived from the original (PDF) on 29 October 2013. Retrieved 2 July 2009.
Konstantopoulos, Panagiotis; Walrand, Jean (September 1989). "Stationary and Stability of Fork-Join Networks" (PDF). Journal of Applied Probability. 26 (3): 604–614. doi:10.2307/3214417. JSTOR 3214417. S2CID 120222029. Archived from the original (PDF) on 18 March 2012.
Varki, Elizabeth; Merchant, Arif; Chen, H. "M/M/1 Fork-join queue with variable sub-tasks" (PDF). Archived from the original (PDF) on 5 August 2010. Retrieved 29 March 2009.

Fork–join queue (English Wikipedia)

adsabs.harvard.edu (Global: 14th place; English: 9th place)

ui.adsabs.harvard.edu

arxiv.org (Global: 49th place; English: 31st place)

cwi.nl (Global: low place; English: low place)

oai.cwi.nl

doi.org (Global: 2nd place; English: 2nd place)

ic.ac.uk (Global: low place; English: low place)

pubs.doc.ic.ac.uk

doc.ic.ac.uk

inria.fr (Global: 6,372nd place; English: 5,582nd place)

hal.inria.fr

jstor.org (Global: 23rd place; English: 15th place)

psu.edu (Global: 299th place; English: 159th place)

citeseerx.ist.psu.edu

semanticscholar.org (Global: 15th place; English: 8th place)

api.semanticscholar.org

technion.ac.il (Global: low place; English: low place)

webee.technion.ac.il

umd.edu (Global: 1,356th place; English: 1,172nd place)

drum.lib.umd.edu

unh.edu (Global: 3,525th place; English: 2,985th place)

cs.unh.edu

uu.se (Global: 3,445th place; English: 3,148th place)

www2.math.uu.se

web.archive.org (Global: 1st place; English: 1st place)

adsabs.harvard.edu (Global: 14^th place; English: 9^th place)

arxiv.org (Global: 49^th place; English: 31^st place)

doi.org (Global: 2^nd place; English: 2^nd place)

inria.fr (Global: 6,372^nd place; English: 5,582^nd place)

jstor.org (Global: 23^rd place; English: 15^th place)

psu.edu (Global: 299^th place; English: 159^th place)

semanticscholar.org (Global: 15^th place; English: 8^th place)

umd.edu (Global: 1,356^th place; English: 1,172^nd place)

unh.edu (Global: 3,525^th place; English: 2,985^th place)

uu.se (Global: 3,445^th place; English: 3,148^th place)

web.archive.org (Global: 1^st place; English: 1^st place)