Answers are grounded in this paper and cite their sources.
Results are obtained for a model of many processors operating in series. The results are obtained directly by recognizing that a sequential processing may be viewed as a cyclic queue. Exact results are given for two sequential processing stages with a buffer storage of arbitrary size between the stages, and approximate results for the case of 2 M ( M an integer) stages. The analysis is good only for exponentially distributed computation times.
No takes yet. Share an insight, caveat, or question.
Leonard Kleinrock (1966) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: