Efficient algorithms for tandem queueing system simulation
classification
🧮 math.NA
cs.DCcs.NA
keywords
algorithmsqueueingsimulationtandembufferscomputationalefficientexamined
read the original abstract
Serial and parallel algorithms for simulation of tandem queueing systems with infinite buffers are presented, and their performance is examined. It is shown that the algorithms which are based on a simple computational procedure involve low time and memory requirements.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.