ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel discrete event simulation
Communications of the ACM - Special issue on simulation
Dynamic load management in the time warp operating system
Transactions of the Society for Computer Simulation International
Allocation of processing power in optimistic parallel discrete event simulation
Allocation of processing power in optimistic parallel discrete event simulation
A new process to processor assignment criterion for reducing rollbacks in optimistic simulation
Journal of Parallel and Distributed Computing - Special issue on parallel and discrete event simulation
Dynamic load balancing in parallel discrete event simulation for spatially explicit problems
PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
On learning algorithms and balancing loads in Time Warp
PADS '99 Proceedings of the thirteenth workshop on Parallel and distributed simulation
On Process Migration and Load Balancing in Time Warp
IEEE Transactions on Parallel and Distributed Systems
Graphs and Hypergraphs
HLA-based Adaptive Distributed Simulation of Wireless Mobile Systems
Proceedings of the seventeenth workshop on Parallel and distributed simulation
MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Proceedings of the 20th Workshop on Principles of Advanced and Distributed Simulation
Adaptive algorithms for the dynamic distribution and parallel execution of agent-based models
Journal of Parallel and Distributed Computing - Special issue on parallel bioinspired algorithms
Simulation of scale-free networks
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Time-parallel simulation of wireless ad hoc networks
Wireless Networks
Hi-index | 0.00 |
The concept of strong groups is introduced to describe the structure of simulation models. It is shown that logical processes within strong groups process at approximately the same rate and that different strong groups can progress at different rates. An algorithm based on the rates of the strong groups is presented to balance the load among the physical processors and for flow control.