Efficient parallel algorithms for tandem queueing system simulation
This work addresses the need for efficient simulation of tandem queueing systems, which is relevant for performance evaluation in operations research and computer systems.
The paper presents parallel algorithms for simulating single-server tandem queueing systems with infinite and finite buffers, achieving low time and memory requirements through recursive equations.
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.