Efficient parallel algorithms for tandem queueing system simulation

TL;DR

This paper introduces efficient parallel algorithms for simulating tandem queueing systems, reducing computational time and memory usage, applicable to systems with both finite and infinite buffers.

Contribution

The paper presents novel parallel algorithms based on recursive equations for tandem queueing system simulation, optimizing performance and resource efficiency.

Findings

Algorithms exhibit low computational time

Memory requirements are minimized

Applicable to systems with finite and infinite buffers

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.