Performance bounds on parallel self-initiating discrete-event simulations
ACM Transactions on Modeling and Computer Simulation (TOMACS)
The local Time Warp approach to parallel simulation
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
A comparative study of parallel algorithms for simulating continuous time Markov chains
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Asynchronous updates in large parallel systems
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Parallelized Direct Execution Simulation of Message-Passing Parallel Programs
IEEE Transactions on Parallel and Distributed Systems
Scheduling critical channels in conservative parallel discrete event simulation
PADS '99 Proceedings of the thirteenth workshop on Parallel and distributed simulation
Composite Synchronization in Parallel Discrete-Event Simulation
IEEE Transactions on Parallel and Distributed Systems
Simulation of large scale networks I: modelling differentiated services in conservative PDES
Proceedings of the 35th conference on Winter simulation: driving innovation
| Hi-index | 0.00 |
Composite synchronization is a new algorithm that combines localized asynchronous coordination, with a global synchronization window. It was developed to simultaneously address the vulnerability of local synchronization to high model connectivity, and the vulnerability that a global window approach has to a very small minimal channel delay. Under composite synchronization, every channel is classified as being either synchronous or asynchronous; the behavior of the algorithm is then determined by the assignment. In an earlier work we proposed the algorithm, and showed that the channel assignment which minimizes the sum of all synchronization overhead, on an architecture with uniform memory access costs, has a threshold structure. The current paper extends that work, showing how speedup depends upon model topology, and that the assignment which maximizes speedup on a multi-cost memory system likewise has a threshold structure, but need not be exactly the same policy as that which minimizes total overhead.