Massively time-parallel,approximate simulation of loss queueing systems |
| |
Authors: | Jain J. Wang Marc Abrams |
| |
Affiliation: | (1) Department of Computer Science, Virginia Polytechnic Institute and State University, 24061-0106 Blacksburg, VA, USA |
| |
Abstract: | A time-parallel simulation obtains parallelism by partitioning the time domain of the simulation. An approximate time-parallel simulation algorithm named GG1K is developed for acyclic networks of loss FCFSG/G/1/K queues. The GG1K algorithm requires two phases. In the first phase, a similar system (i.e. aG/G/1/ queue) is simulated using the GLM algorithm. Then the resultant trajectory is transformed into an approximateG/G/1/K trajectory in the second phase. The closeness of the approximation is investigated theoretically and experimentally. Our results show that the approximation is highly accurate except whenK is very small (e.g. 5) in certain models. The algorithm exploits unbounded parallelism and can achieve near-linear speedup when the number of arrivals simulated is sufficiently large. |
| |
Keywords: | Discrete event simulation trajectory space-parallel time-parallel approximation recurrence relation |
本文献已被 SpringerLink 等数据库收录! |