Efficient parallel algorithms for tandem queueing system simulation

Research outputpeer-review

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.
Original languageEnglish
Title of host publicationSystem Simulation and Scientific Computing - Proceedings of the 3rd Beijing International Conference on System Simulation and Scientific Computing, Beijing, China, October 17-19. Delayed Papers
PublisherInternational Academic Publishers
Pages8-12
ISBN (Print)7-8003-351-1
Publication statusPublished - 1995

Scopus subject areas

  • Modelling and Simulation
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'Efficient parallel algorithms for tandem queueing system simulation'. Together they form a unique fingerprint.

Cite this