Discrete Event Execution with One-Sided and Two-Sided GVT Algorithms on 216,000 Processor Cores
- ORNL
Global virtual time (GVT) computation is a key determinant of the efficiency and runtime dynamics of parallel discrete event simulations (PDES), especially on large-scale parallel platforms. Here, three execution modes of a generalized GVT computation algorithm are studied on high-performance parallel computing systems: (1) a synchronous GVT algorithm that affords ease of implementation, (2) an asynchronous GVT algorithm that is more complex to implement but can relieve blocking latencies, and (3) a variant of the asynchronous GVT algorithm to exploit one-sided communication in extant supercomputing platforms. Performance results are presented of implementations of these algorithms on up to 216,000 cores of a Cray XT5 system, exercised on a range of parameters: optimistic and conservative synchronization, fine- to medium-grained event computation, synthetic and non-synthetic applications, and different lookahead values. Performance of up to 54 billion events executed per second is registered. Detailed PDES-specific runtime metrics are presented to further the understanding of tightly-coupled discrete event dynamics on massively parallel platforms.
- Research Organization:
- Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States). Oak Ridge Leadership Computing Facility (OLCF)
- Sponsoring Organization:
- USDOE Office of Science (SC)
- DOE Contract Number:
- DE-AC05-00OR22725
- OSTI ID:
- 1132340
- Journal Information:
- ACM Transactions on Modeling and Computer Simulation, Vol. 24, Issue 3; ISSN 1049-3301
- Publisher:
- Association for Computing Machinery
- Country of Publication:
- United States
- Language:
- English
Similar Records
Computer Science Research Needs for Parallel Discrete Event Simulation (PDES)
Scaling Time Warp-based Discrete Event Execution to 104 Processors on Blue Gene Supercomputer