Response times in M/M/s fork-join networks

Advances in Applied Probability

Volumn 36, Issue 3, 2004, Pages 854-871

  Ko, Sung Seok ^a   Serfozo, Richard F ^b  

^a Samsung SDS   (South Korea)

^b Georgia Institute of Technology   (United States)

Author keywords

Assembly network; Communications network; Fork join network; Little law for distributions; Parallel processing; Queueing; Supply chain; Synchronization

Indexed keywords

APPROXIMATION THEORY; ASSEMBLY; COMPUTER SIMULATION; LAPLACE TRANSFORMS; METHOD OF MOMENTS; PARALLEL PROCESSING SYSTEMS; POISSON DISTRIBUTION; PROBABILITY DISTRIBUTIONS; QUEUEING THEORY; STATISTICAL TESTS; TELECOMMUNICATION NETWORKS;

ASSEMBLY NETWORK; FORK-JOIN NETWORK; LITTLE LAW-FOR-DISTRIBUTIONS; PARALLEL PROCESSING; SUPPLY CHAIN;

MARKOV PROCESSES;

EID: 7444268607     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1093962238     Document Type: Article

References (24)

1. Ayhan, H. and Seo, D. W. (2001). Laplace transform and moments of waiting times in (max,+) linear systems with Poisson input. Queueing Systems 37, 405-438.
2. Baccelli, F. and Brémaud, P. (1994). Elements of Queueing Theory. Springer, New York.
3. Baccelli F. and Makowski, A. M. (1985). Simple computable bounds for the fork-join queue. In Proc. Johns Hopkins Conf. Inf. Sci., Johns Hopkins University Press, Baltimore, MD.
4. Baccelli, F., Makowski, A. M. and Shwartz, A. (1989). The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds. Adv. Appl. Prob. 21, 629-660.
5. Balsamo, S., Donatietllo, L. and Van Dijk, N. M. (1998). Bound performance models of heterogeneous parallel processing systems. IEEE Trans. Parallel Distributed Systems 9, 1041-1056.
6. Chen, R. J. (2001). A hybrid solution of fork/join synchronization in parallel queues. IEEE Trans. Parallel Distributed Systems 12, 829-845.
7. Flatto, L. (1985). Two parallel queues created by arrivals with two demands II. SIAM J. Appl. Math. 45, 861-878.
8. Flatto, L. and Hahn, S. (1984). Two parallel queues created by arrivals with two demands I. SIAM J. Appl. Math. 44, 1041-1053. Erratum: 45, 168 (1985).
9. Haji, R. and Newell, G. F. (1971). A relation between stationary queue and waiting time distributions. J. Appl. Prob. 8, 617-620.
10. Knessl, C. (1991). On the diffusion approximation to a fork and join queueing model. SIAM J. Appl. Math. 51, 160-171.
11. Konstantopoulos, P. and Walrand, J. (1989). Stationary and stability of fork-join networks. J. Appl. Prob. 26, 604-614.
12. Krishnamurthy, A., Suri, R. and Vernon, M. (2004). Analysis of a fork /join synchronization station with inputs from Coxian servers in a closed queueing network. Ann. Operat. Res. 125, 69-94.
13. Kulkarni, V. G. (1995). Modeling and Analysis of Stochastic Systems. Chapman and Hall, London.
14. Kumar, A. and Shorey, R. (1993). Performance analysis and scheduling of stochastic fork-join jobs in a multicomputer system. IEEE Trans. Parallel Distributed Systems 4, 1147-1164.
15. Kushner, H. J. (2001). Heavy Traffic Analysis of Controlled Queueing and Communication Networks (Appl. Math. (New York) 47). Springer, New York.
16. Law, A. M. and Kelton, W. D. (1991). Simulation Modeling and Analysis. McGraw-Hill, New York.
17. Nelson, R. And Tantawi A. N. (1988). Approximation analysis of fork/join synchronization in parallel queues. IEEE Trans. Comput. 37, 739-743.
18. Nguyen, V. (1993). Processing networks with parallel and sequential tasks: heavy traffic analysis and Brownian limits. Ann. Appl. Prob. 3, 28-55.
19. Raghavan, N. R. S. and Viswanadham, N. (2001). Generalized queueing network analysis of integrated supply chains. Internat. J. Production Res. 39, 205-224.
20. Ross, S. M. (1996). Stochastic Processes, 2nd edn. John Wiley, New York.
21. Serfozo, R. F. (1999). Introduction to Stochastic Networks (Appl. Math. (New York) 44). Spinger, New York.
22. Tan, X. and Knessl, C. (1996). A fork-join queueing model: diffusion approximation, integral representations and asymptotics. Queueing Systems 22, 287-322.
23. Varma, S. and Makowski, A. (1994). Interpolation approximations for symmetric fork-join queues. Performance Evaluation 20, 245-265.
24. Zhang, Z. (1990). Analytical results for waiting time and system size distributions in two parallel queueing systems. SIAM J. Appl. Math. 50, 1176-1193.