论文信息 - Efficient parallel algorithms for tandem queueing system simulation

Efficient parallel algorithms for tandem queueing system simulation

Parallel algorithms designed for simulation and performance evaluation of single-server tandem queueing systems with both infinite and finite buffers are presented. The algorithms exploit a simple computational procedure based on recursive equations as a representation of system dynamics. A brief analysis of the performance of the algorithms are given to show that they involve low time and memory requirements.

Nikolai K. Krivulin | Sergei M. Ermakov | N. Krivulin | S. Ermakov

[1] Dinah W. Cheng,et al. On the design of a tandem queue with blocking: Modeling, analysis, and gradient estimation , 1994 .

[2] Nikolai Krivulin. Optimization of complex systems for simulation modeling , 1990 .

[3] Philip Heidelberger,et al. Discrete event simulations and parallel processing: statistical properties , 1988 .

[4] J. Ortega. Introduction to Parallel and Vector Solution of Linear Systems , 1988, Frontiers of Computer Science.

[5] Nikolai K. Krivulin,et al. Recursive equations based models of queueing systems , 2012, 1210.7445.

[6] S. M. Ermakow. Die Monte-Carlo-Methode und verwandte Fragen , 1975 .

[7] Nikolai Krivulin. Unbiased estimates for gradients of stochastic network performance measures , 1993 .

[8] Liang Chen,et al. A fast simulation approach for tandem queueing systems , 1990, 1990 Winter Simulation Conference Proceedings.

[9] Albert G. Greenberg,et al. Algorithms for unboundedly parallel simulations , 1991, TOCS.

[10] Nikolai K. Krivulin,et al. Efficient algorithms for tandem queueing system simulation , 2012, ArXiv.