Analysis of Fork/Join and Related Queueing Systems

@article{Thomasian2014AnalysisOF,
  title={Analysis of Fork/Join and Related Queueing Systems},
  author={Alexander Thomasian},
  journal={ACM Comput. Surv.},
  year={2014},
  volume={47},
  pages={17:1-17:71}
}
Fork/join (F/J) requests arise in contexts such as parallel computing, query processing in parallel databases, and parallel disk access in RAID. F/J requests spawn <i>K</i> tasks that are sent to <i>K</i> parallel servers, and the completion of all <i>K</i> tasks marks the completion of an F/J request. The exact formula for the mean response time of <i>K</i> = 2-way F/J requests derived under Markovian assumptions (<i>R<sup>F/J</sup></i><sub>2</sub>) served as the starting point for an… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS

Citations

Publications citing this paper.
Showing 1-10 of 14 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 41 references

Performance evaluation of two-disk failure tolerant arrays

  • A. Thomasian, C. Han, G. Fu.
  • IEEE Transactions on Computers C-56, 6, 799–814.
  • 2007
Highly Influential
20 Excerpts

Continuous Univariate Distributions (Vol

  • N. L. Johnson, S. Kotz, N. Balakrishnan.
  • 2, 2nd ed.). Wiley Series in Probability and…
  • 1995
Highly Influential
13 Excerpts

Similar Papers

Loading similar papers…