Efficient parallel algorithms for tandem queueing system simulation
Numerical Analysis
2012-11-30 v1 Distributed, Parallel, and Cluster Computing
Systems and Control
Abstract
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.
Cite
@article{arxiv.1211.6778,
title = {Efficient parallel algorithms for tandem queueing system simulation},
author = {Sergei M. Ermakov and Nikolai K. Krivulin},
journal= {arXiv preprint arXiv:1211.6778},
year = {2012}
}
Comments
The 3rd Beijing International Conference on System Simulation and Scientific Computing, October 17-19, 1995, Beijing, China