An expansion-aided synchronous conservative time management algorithm on GPU

Authors:
Tang Wenjie;Yao Yiping;Zhu Feng
Affiliations:
School of Computer, National University of Defense Technology, Changsha, China;School of Information System and Management, National University of Defense Technology, Changsha, China;School of Computer, National University of Defense Technology, Changsha, China
Venue:
Proceedings of the 2013 ACM SIGSIM conference on Principles of advanced discrete simulation
Year:
2013

Citing 8
Cited 0

The cost of conservative synchronization in parallel discrete event simulations

Journal of the ACM (JACM)
Parallel and Distribution Simulation Systems

Parallel and Distribution Simulation Systems
Discrete-event Execution Alternatives on General Purpose Graphical Processing Units (GPGPUs)

Proceedings of the 20th Workshop on Principles of Advanced and Distributed Simulation
NVIDIA Tesla: A Unified Graphics and Computing Architecture

IEEE Micro
A GPU-Based Application Framework Supporting Fast Discrete-Event Simulation

Simulation
An analysis of queuing network simulation using GPU-based hardware acceleration

ACM Transactions on Modeling and Computer Simulation (TOMACS)
GPGPU-aided ensemble empirical-mode decomposition for EEG analysis during anesthesia

IEEE Transactions on Information Technology in Biomedicine
Multi-level Parallelism for Time- and Cost-Efficient Parallel Discrete Event Simulation on GPUs

PADS '12 Proceedings of the 2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The graphic processing unit (GPU) brings an opportunity to implement large scale simulations in an economical way. GPU's performance relies on high parallelism, but using synchronous conservative time management algorithm for discrete event simulation will meet the scenarios with limited parallelism. This conflict leads to bad performance even though the application itself has high parallelism. To solve this problem, we propose an expansion-aided synchronous conservative time management algorithm. It uses runtime information to enlarge the time bound of "safe" events, and uses an expansion method to import "safe" events. By interleaving a series of expansions with event computation, more events can be assembled to be processed in parallel. Moreover, a simulated annealing algorithm is adopted to control the number of expansions. It helps achieve stable performance under different conditions by finding a balance between low parallelism and unnecessary expansions. Experiments demonstrate that the proposed algorithm can achieve up to a 30% performance improvement.