Approximate Analysis of Fork/Join Synchronization in Parallel Queues

IEEE Transactions on Computers

Volumn 37, Issue 6, 1988, Pages 739-743

  Nelson, R ^a   Tantawi, A N ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Fork join queues; modeling and analysis; parallel; queues; scaling approximation; synchronization

Indexed keywords

COMPUTER SYSTEMS, DIGITAL - SYNCHRONIZATION; MATHEMATICAL TECHNIQUES - APPROXIMATION THEORY;

HOMOGENEOUS FORK/JOIN QUEUEING SYSTEMS; PARALLEL QUEUES; SCALING APPROXIMATION;

PROBABILITY;

EID: 0024032823     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.2213     Document Type: Article

References (8)

1. F. Baccelli and A. M. Makowski. “Simple computable bounds for the fork-join queue,” in Proc. John Hopkins Conf. Inf. Sei., John Hopkins Univ., 1985
2. R. E. Barlow and R. Proschan, Statistical Theory of Reliability and Life Testing. Holt, Reinhart and Winston, 1975.
3. L. Flatto and S. Hahn, “Two parallel queues created by arrivals with two demands I,” SIAM J. Appl. Math., vol. 44, pp. 1041–1053, Oct. 1984.
4. L. Flatto, “Two parallel queues created by arrivals with two demands II,” SIAM J. Appl. Math., vol. 45, pp. 861–878, Oct. 1985.
5. P. Heidelberger and K. S. Trivedi, “Queueing network models for parallel processing with asynchronous tasks,” IEEE Trans. Comput., vol. C-31, pp. 1099–1109, Nov. 1982.
6. “Analytic queueing models for programs with internal concurrency,” IEEE Trans. Comput., vol. C-32, pp. 73–82, Jan. 1983.
7. L. Kleinrock, Queueing Systems, Vol. I: Theory. New York: Wiley, 1975.
8. R. D. Nelson and B. R. Iyer, “Analysis of a replicated data base,” Perform. Eval., vol. 5, pp. 133–148, Aug. 1985.