Efficient parallel algorithms for tandem queueing system simulation
From MaRDI portal
Publication:6237577
Authors: Sergeĭ Mikhaĭlovich Ermakov, Nikolai Krivulin 
Publication date: 28 November 2012
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.
Parallel numerical computation (65Y05) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Simulation of dynamical systems (37M05)
This page was built for publication: Efficient parallel algorithms for tandem queueing system simulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6237577)
