Self-adjusting binary search trees
Journal of the ACM (JACM)
Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
Communications of the ACM
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
Efficient implementation of event sets in Time Warp
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
Clustered time warp and logic simulation
PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
Parameterized Time Warp (PTW): an integrated adaptive solution to optimistic PDES
Journal of Parallel and Distributed Computing
Lazy queue: an efficient implementation of the pending-event set
ANSS '91 Proceedings of the 24th annual symposium on Simulation
Unveiling the ISCAS-85 Benchmarks: A Case Study in Reverse Engineering
IEEE Design & Test
External Adjustment of Runtime Parameters in Time Warp Synchronized Parallel Simulators
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
WARPED: A Time Warp Simulation Kernel for Analysis and Application Development
HICSS '96 Proceedings of the 29th Hawaii International Conference on System Sciences Volume 1: Software Technology and Architecture
Dynamically switching between lazy and aggressive cancellation in a Time Warp parallel simulator
SS '95 Proceedings of the 28th Annual Simulation Symposium
Ladder queue: An O(1) priority queue structure for large-scale discrete event simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Viewpoint: Face the inevitable, embrace parallelism
Communications of the ACM - The Status of the P versus NP Problem
A low-overhead constant-time LTF scheduler for optimistic simulation systems
ISCC '10 Proceedings of the The IEEE symposium on Computers and Communications
Towards Symmetric Multi-threaded Optimistic Simulation Kernels
PADS '12 Proceedings of the 2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation
Using DVFS to optimize time warp simulations
Proceedings of the Winter Simulation Conference
| Hi-index | 0.00 |
Multi-core and many-core processing chips are becoming widespread and are now being widely integrated into Beowulf clusters. This poses a challenging problem for distributed simulation as it now becomes necessary to extend the algorithms to operate on a platform that includes both shared memory and distributed memory hardware. Furthermore, as the number of on-chip cores grows, the challenges for developing solutions without significant contention for shared data structures grows. This is especially true for the pending event list data structures where multiple execution threads attempt to schedule the next event for execution. This problem is especially aggravated in parallel simulation, where event executions are generally fine-grained leading quickly to non-trivial contention for the pending event list. This manuscript explores the design of the software architecture and several data structures to manage the pending event sets for execution in a Time Warp synchronized parallel simulation engine. The experiments are especially targeting multi-core and many-core Beowulf clusters containing 8-core to 48-core processors. These studies include a two-level structure for holding the pending event sets using three different data structures, namely: splay trees, the STL multiset, and ladder queues. Performance comparisons of the three data structures using two architectures for the pending event sets are presented.