Efficient distributed event-driven simulations of multiple-loop networks
Communications of the ACM
A bridging model for parallel computation
Communications of the ACM
Parallel discrete event simulation
Communications of the ACM - Special issue on simulation
Discrete event simulation in parallel
Advances in parallel algorithms
Cilk: an efficient multithreaded runtime system
PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
An introduction to distributed algorithms
An introduction to distributed algorithms
Dag consistent parallel simulation: a predictable and robust conservative algorithm
Proceedings of the eleventh workshop on Parallel and distributed simulation
The implementation of the Cilk-5 multithreaded language
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Parallel and Distribution Simulation Systems
Parallel and Distribution Simulation Systems
Simulation Model Design and Execution: Building Digital Worlds
Simulation Model Design and Execution: Building Digital Worlds
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Cilk: efficient multithreaded computing
Cilk: efficient multithreaded computing
The resource sharing system: dynamic federate mapping for HLA-based distributed simulation
Proceedings of the fifteenth workshop on Parallel and distributed simulation
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
| Hi-index | 0.00 |
Many synchronous algorithms have been proposed for parralel and discrete simulations. However, the actual performance of these algorithms have been far from ideal, especially when event granularity is small. Barring the case of low parallelism in the given simulation models, one of the main reasons of low speedups is in the uneven load distribution among processors. We present several new locality-preserving load balancing mechanisms for synchronous simulations on shared-memory multiprocessors. We show both theoretically and empirically that some of these mechanisms incur very low overhead. The results confirm that one of the new mechanisms is indeed more efficient and scalable than common existing approaches.