Fork-join Queueing Networks

Fork-Join Queueing Networks is a class of stochastic queueing network models characterized by the synchronization of multiple parallel tasks through a fork mechanism that splits a job into concurrent subtasks and a join mechanism that recombines completed subtasks before service completion.

78

Publications

3K

Citations

115

Authors

77

Institutions

Publications per year

2017–2026

7

Variants

Fork-join Queuing Networks

Authors

115

  1. DT
    Don Towsley

    University of Massachusetts Amherst, United States

    7 publications · 361 citations

    7

    h-index

  2. FB
    François Baccelli

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

    5 publications · 293 citations

    5

    h-index

  3. AR
    Amr Rizk

    Technische Universität Darmstadt, Germany

    4 publications · 89 citations

    4

    h-index

  4. RH
    Randy H. Katz

    University of California, Berkeley, United States

    4 publications · 195 citations

    4

    h-index

  5. AT
    Alexander Thomasian

    IBM Research - Thomas J. Watson Research Center, United States

    4 publications · 191 citations

    4

    h-index

1–5 of 115

Venues

  1. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 7 publications · 305 citations

    7

    h-index

  2. ACM SIGMETRICS Performance Evaluation Review

    PER · 5 publications · 85 citations

    5

    h-index

  3. Advances in Applied Probability

    AAP · 4 publications · 140 citations

    4

    h-index

  4. Performance Evaluation

    4 publications · 195 citations

    4

    h-index

  5. OpenGrey (Institut de l'Information Scientifique et Technique)

    Repository · 3 publications · 90 citations

    3

    h-index

1–5