Quantitative system performance: computer system analysis using queueing network models
Quantitative system performance: computer system analysis using queueing network models
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient distributed event-driven simulations of multiple-loop networks
Communications of the ACM
Efficient aggregation of multiple PLs in distributed memory parallel simulations
WSC '89 Proceedings of the 21st conference on Winter simulation
Parallel discrete event simulation
Communications of the ACM - Special issue on simulation
Performance bounds on parallel self-initiating discrete-event simulations
ACM Transactions on Modeling and Computer Simulation (TOMACS)
The cost of conservative synchronization in parallel discrete event simulations
Journal of the ACM (JACM)
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Probability and Statistics with Reliability, Queuing and Computer Science Applications
The Wisconsin Wind Tunnel: virtual prototyping of parallel computers
SIGMETRICS '93 Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Cost/performance of a parallel computer simulator
PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation
Optimistic simulation of parallel architectures using program executables
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
Modeling cost/performance of a parallel computer simulator
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Performance modeling of the IDES framework
Proceedings of the eleventh workshop on Parallel and distributed simulation
Hierarchical modeling and distributed simulation with HIT
Proceedings of the eleventh workshop on Parallel and distributed simulation
Time-parallel simulation of wireless ad hoc networks
Wireless Networks
| Hi-index | 0.00 |
A conservative synchronization protocol for the parallel simulation of queuing networkshaving C job priority classes, where a job's class is fixed, is described. This problem has long vexed designers of conservative synchronization protocols because of its seemingly poor ability to compute lookahead: the time of the next departure. For, a job in service having low priority can be preempted at any time by an arrival having higher priority and an arbitrarily small service time. The solution is to slow the event generation activity so that events for higher priority jobs are generated farther ahead in simulated time than lower priority jobs. Thus. when a lower priority job enters service for the first time, all the higher priority jobs that may preempt it are already known and the job's departure time can be exactly predicted. The author analyzes the protocol and demonstrates that good performance can be expected on the simulation of large queuing networks.