For the preemptive queuing system there are mathematical formulae only in a few cases, for some distributions of the input flow and the ou iut flow and for a constant number of parallel working stations. Since for a variable number of parallel stations, there is no analytic formula, then an algorithmic approach is very important in their study. Also, this queuing system class cannot be simulated using an available discrete-event simulation package. This paper proposes a simulation algorithm for a variable number of parallel stations preemptive queuing system. Also, based on estimating the maximum number of comparisons, the polynomial complexity of the presented algorithm is proved. I conclude thus paper by comparing the simulation results, in the case of variable number, with the results of the simulator for the constant number of parallel working stations, with the same serving discipline.
Preemptive queuing system, Simulation, Algorithm complexity, Variable number of servers.
All articles published by Studies in Informatics and Control (SIC) are published in accordance with the terms and conditions of the Creative Commons Attribution License (CC BY-NC-SA 4.0).