Efficient algorithms for distributed snapshots and global virtual time approximation
Journal of Parallel and Distributed Computing - Special issue on parallel and discrete event simulation
GTW: a time warp system for shared memory multiprocessors
WSC '94 Proceedings of the 26th conference on Winter simulation
Computing global virtual time in shared-memory multiprocessors
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Hoard: a scalable memory allocator for multithreaded applications
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Proceedings of the 3rd international symposium on Memory management
Parallel and Distribution Simulation Systems
Parallel and Distribution Simulation Systems
Simulation Modeling and Analysis
Simulation Modeling and Analysis
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
Distributed simulation, algorithms and performance analysis (load balancing, distributed processing)
Distributed simulation, algorithms and performance analysis (load balancing, distributed processing)
Scalable lock-free dynamic memory allocation
Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
µsik " A Micro-Kernel for Parallel/Distributed Simulation Systems
Proceedings of the 19th Workshop on Principles of Advanced and Distributed Simulation
Proceedings of the 19th Workshop on Principles of Advanced and Distributed Simulation
EDEVS: A Scalable DEVS Formalism for Event-Scheduling Based Parallel and Distributed Simulations
DS-RT '09 Proceedings of the 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications
Synchronization in federation community networks
Journal of Parallel and Distributed Computing
Massively parallel Modelling & Simulation of large crowd with GPGPU
The Journal of Supercomputing
Hi-index | 0.00 |
The development of CPU has stepped into the era of multicore. Current parallel simulation kernel utilizes multicore resource by multi-process, which leads to inefficiency on communication and synchronization. To fulfill this gap, we proposed a HPSK (hierarchical parallel simulation kernel) model, which schedules logical processes and executes events in parallel with multithread paradigm. Based on this model, three key algorithms were proposed to support high performance: (1) An event management algorithm was proposed to improve the efficiency of creation and release of events. It uses a lock-free creation and asynchronous commitment mechanism to decouple the relationship between threads, hence reduce the overhead of locks. (2) A pointer-based communication algorithm was proposed to improve efficiency of communication between threads. It uses a buffer mechanism to avoid interrupting the execution of target thread. The target thread will read events from the buffers when it needs. By using ring-structure buffers, synchronization between sending and receiving of threads can be annihilated. (3) An approximate method was proposed to compute LBTS (Lower Bound on Time Stamp). It uses an asynchronous mechanism to eliminate disturbing of thread execution and a two-level filter mechanism to reduce redundant LBTS computation. A series of experiments with a modified phold model show that HPSK can achieve good performance for applications on different conditions. It can run 8脳 faster than μsik when event locality and lookahead is low.