This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Approximate Analysis of Fork/Join Synchronization in Parallel Queues
June 1988 (vol. 37 no. 6)
pp. 739-743
An approximation technique, called scaling approximation, is introduced and applied to the analysis of homogeneous fork/join queuing systems consisting of K

[1] F. Baccelli and A. M. Makowski, "Simple computable bounds for the fork-join queue," inProc. John Hopkins Conf. Inf. Sci., 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] P. Heidelberger and K. S. Trivedi, "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. 1: 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, 1985.

Index Terms:
upper bounds; fork/join synchronization; parallel queues; scaling approximation; lower bounds; mean response time; closed-form approximate expressions; simulation results; approximation theory; queueing theory; synchronisation.
Citation:
R. Nelson, A.N. Tantawi, "Approximate Analysis of Fork/Join Synchronization in Parallel Queues," IEEE Transactions on Computers, vol. 37, no. 6, pp. 739-743, June 1988, doi:10.1109/12.2213
Usage of this product signifies your acceptance of the Terms of Use.