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

Authors

113

  1. AM
    Armand M. Makowski

    University of Maryland, College Park, United States

    7 publications · 556 citations

    7

    h-index

  2. DT
    Don Towsley

    University of Massachusetts Amherst, United States

    6 publications · 210 citations

    6

    h-index

  3. FB
    François Baccelli

    Institut national de recherche en sciences et technologies du numérique, France

    6 publications · 459 citations

    6

    h-index

  4. RH
    Randy H. Katz

    University of California, Berkeley, United States

    4 publications · 195 citations

    4

    h-index

  5. AR
    Amr Rizk

    Technische Universität Darmstadt, Germany

    4 publications · 89 citations

    4

    h-index

1–5 of 113

Venues

  1. Advances in Applied Probability

    AAP · 6 publications · 327 citations

    6

    h-index

  2. ACM SIGMETRICS Performance Evaluation Review

    PER · 5 publications · 283 citations

    5

    h-index

  3. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 5 publications · 158 citations

    5

    h-index

  4. IEEE Transactions on Computers

    4 publications · 491 citations

    4

    h-index

  5. Performance Evaluation

    4 publications · 195 citations

    4

    h-index

1–5