Fork-join Queues
Fork-Join Queues is a queuing model in which a single arriving job is split into multiple parallel tasks (forked) upon entry and must wait until all corresponding tasks are completed and synchronized (joined) before departing the system, distinguishing it from standard queuing models by its synchronization mechanism for parallel processing.
74
Publications
3.7K
Citations
113
Authors
76
Institutions
Publications per year
2017–2026
7
Variants
Fork-join Queuing Systems
Parents
74
Doug Lea · 2000 · 452 citations
Marco Bertoli, Giuliano Casale, Giuseppe Serazzi · ACM SIGMETRICS Performance Evaluation Review · 2009 · 211 citations
1–5 of 74
113
7
h-index
6
h-index
Institut national de recherche en sciences et technologies du numérique, France
6 publications · 459 citations
6
h-index
4
h-index
4
h-index
1–5 of 113
76
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
8 h-index
8 publications
568 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
7 h-index
11 publications
939 citations
University of Maryland, College Park
College Park, United States
6 h-index
6 publications
509 citations

University of Massachusetts Amherst
Amherst Center, United States
5 h-index
5 publications
204 citations
Georgia Institute of Technology
Atlanta, United States
4 h-index
5 publications
181 citations
Massachusetts Institute of Technology
Cambridge, United States
4 h-index
4 publications
295 citations
University of California, Berkeley
Berkeley, United States
4 h-index
8 publications
211 citations
IBM (United States)
Armonk, United States
4 h-index
9 publications
907 citations
1–8 of 76
AAP · 6 publications · 327 citations
6
h-index
PER · 5 publications · 283 citations
5
h-index
TPDS · 5 publications · 158 citations
5
h-index
4 publications · 491 citations
4
h-index
4 publications · 195 citations
4
h-index
1–5