Parallel simulation of queueing networks: limitations and potentials
SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Algorithms for unboundedly parallel simulations
ACM Transactions on Computer Systems (TOCS)
Approximate time-parallel simulation of queueing systems with losses
WSC '92 Proceedings of the 24th conference on Winter simulation
A time-division algorithm for parallel simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Time-segmentation parallel simulation of networks of queues with loss or communication blocking
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Statistical analysis of parallel simulations
WSC '86 Proceedings of the 18th conference on Winter simulation
Parallel trace-driven cache simulation by time partitioning
WSC' 90 Proceedings of the 22nd conference on Winter simulation
Parallel and Distribution Simulation Systems
Parallel and Distribution Simulation Systems
Parallel simulation by multi-instruction, longest-path algorithms
Queueing Systems: Theory and Applications
Time-parallel simulation with approximative state matching
Proceedings of the eighteenth workshop on Parallel and distributed simulation
The Anatomy of the Grid: Enabling Scalable Virtual Organizations
International Journal of High Performance Computing Applications
Python for scientific computing education: Modeling of queueing systems
Scientific Programming
| Hi-index | 0.00 |
Queuing systems are an important building block for performance evaluation in various application areas, due to their powerful, yet simple nature. Although it is often possible to perform an analytical evaluation of a queuing model, simulation of queuing systems remains an important technique in the context of performance evaluation. In order to speed up queuing simulation executions, parallel and distributed simulation techniques have been devised. Unfortunately, existing methods are complex in nature, leading to increased development costs. Moreover, most of these approaches have been developed for tightly coupled parallel processing machines. Consequently, they are not suited for a distributed computing environment. This paper investigates an alternative approach based on the technique of time-parallel simulation with fix-up computations. The salient features of this novel approach are its simplicity and its suitability for execution in a distributed environment.