GVT Algorithms and Discrete Event Dynamics on 128K+ Processor Cores

Title: GVT Algorithms and Discrete Event Dynamics on 128K+ Processor Cores

Full Record
Other Related Research

Abstract

Parallel discrete event simulation (PDES) represents a class of codes that are challenging to scale to large number of processors due to tight global timestamp-ordering and fine-grained event execution. One of the critical factors in scaling PDES is the efficiency of the underlying global virtual time (GVT) algorithm needed for correctness of parallel execution and speed of progress. Although many GVT algorithms have been proposed previously, few have been proposed for scalable asynchronous execution and none customized to exploit one-sided communication. Moreover, the detailed performance effects of actual GVT algorithm implementations on large platforms are unknown. Here, three major GVT algorithms intended for scalable execution on high-performance systems are studied: (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, proposed and studied for the first time here, to exploit one-sided communication in extant supercomputing platforms. Performance results are presented of implementations of these algorithms on over 64,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 differentmore »« less

Authors:

Perumalla, Kalyan S ^[1]; Park, Alfred J ^[1]; Tipparaju, Vinod ^[1]

ORNL

Publication Date:: 2011-01-01

Research Org.:: Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Center for Computational Sciences

Sponsoring Org.:: USDOE Laboratory Directed Research and Development (LDRD) Program

OSTI Identifier:: 1034668

DOE Contract Number:: DE-AC05-00OR22725

Resource Type:: Conference

Resource Relation:: Conference: International Conference on High Performance Computing, Bangalore, India, 20111218, 20111221

Country of Publication:: United States

Language:: English

Subject:: 99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; ALGORITHMS; COMMUNICATIONS; COMPUTERS; COMPUTER CODES; EFFICIENCY; IMPLEMENTATION; METRICS; PERFORMANCE; SIMULATION; SYNCHRONIZATION; VELOCITY

Citation Formats


                    Perumalla, Kalyan S, Park, Alfred J, and Tipparaju, Vinod. GVT Algorithms and Discrete Event Dynamics on 128K+ Processor Cores.  United States: N. p., 2011. 
        Web.

Copy to clipboard


                    Perumalla, Kalyan S, Park, Alfred J, & Tipparaju, Vinod. GVT Algorithms and Discrete Event Dynamics on 128K+ Processor Cores.  United States.

Copy to clipboard


                    Perumalla, Kalyan S, Park, Alfred J, and Tipparaju, Vinod. Sat .  
        "GVT Algorithms and Discrete Event Dynamics on 128K+ Processor Cores".  United States.

Copy to clipboard


                    
@article{osti_1034668,

  title        = {GVT Algorithms and Discrete Event Dynamics on 128K+ Processor Cores},

  author       = {Perumalla, Kalyan S and Park, Alfred J and Tipparaju, Vinod},

  abstractNote = {Parallel discrete event simulation (PDES) represents a class of codes that are challenging to scale to large number of processors due to tight global timestamp-ordering and fine-grained event execution. One of the critical factors in scaling PDES is the efficiency of the underlying global virtual time (GVT) algorithm needed for correctness of parallel execution and speed of progress. Although many GVT algorithms have been proposed previously, few have been proposed for scalable asynchronous execution and none customized to exploit one-sided communication. Moreover, the detailed performance effects of actual GVT algorithm implementations on large platforms are unknown. Here, three major GVT algorithms intended for scalable execution on high-performance systems are studied: (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, proposed and studied for the first time here, to exploit one-sided communication in extant supercomputing platforms. Performance results are presented of implementations of these algorithms on over 64,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 tens of billions of events executed per second are registered, exceeding the speeds of any known PDES engine, and showing asynchronous GVT algorithms to outperform state-of-the-art synchronous GVT algorithms. Detailed PDES-specific runtime metrics are presented to further the understanding of tightly-coupled discrete event execution dynamics on massively parallel platforms.},

  doi          = {},

  url          = {https://www.osti.gov/biblio/1034668},
  journal      = {},
number       = ,

  volume       = ,

  place        = {United States},

  year         = {2011},

  month        = {1}

}

Copy to clipboard

Conference:

Other availability

Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share:

Export Metadata

Save to My Library

Similar records in OSTI.GOV collections:

Discrete Event Execution with One-Sided and Two-Sided GVT Algorithms on 216,000 Processor Cores

Journal Article Perumalla, Kalyan S ; Park, Alfred J ; Tipparaju, Vinod - ACM Transactions on Modeling and Computer Simulation

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 coresmore »« less
https://doi.org/10.1145/2611561
Scaling Time Warp-based Discrete Event Execution to 10 ⁴ Processors on Blue Gene Supercomputer

Conference Perumalla, Kalyan S

Lately, important large-scale simulation applications, such as emergency/event planning and response, are emerging that are based on discrete event models. The applications are characterized by their scale (several millions of simulated entities), their fine-grained nature of computation (microseconds per event), and their highly dynamic inter-entity event interactions. The desired scale and speed together call for highly scalable parallel discrete event simulation (PDES) engines. However, few such parallel engines have been designed or tested on platforms with thousands of processors. Here an overview is given of a unique PDES engine that has been designed to support Time Warp-style optimistic parallel executionmore »« less
Visual Data-Analytics of Large-Scale Parallel Discrete-Event Simulations

Conference Ross, Caitlin ; Carothers, Christopher D. ; Mubarak, Misbah ; ...

Parallel discrete-event simulation (PDES) is an important tool in the codesign of extreme-scale systems because PDES provides a cost-effective way to evaluate designs of highperformance computing systems. Optimistic synchronization algorithms for PDES, such as Time Warp, allow events to be processed without global synchronization among the processing elements. A rollback mechanism is provided when events are processed out of timestamp order. Although optimistic synchronization protocols enable the scalability of large-scale PDES, the performance of the simulations must be tuned to reduce the number of rollbacks and provide an improved simulation runtime. To enable efficient large-scale optimistic simulations, one has tomore »« less
https://doi.org/10.1109/PMBS.2016.014

Full Text Available
Partial differential equations preconditioner resilient to soft and hard faults

Journal Article Rizzi, F. ; Morris, K. ; Sargsyan, K. ; ... - International Journal of High Performance Computing Applications

We present a domain-decomposition-based preconditioner for the solution of partial differential equations (PDEs) that is resilient to both soft and hard faults. The algorithm reformulates the PDE as a sampling problem, followed by a solution update through data manipulation that is resilient to both soft and hard faults. This reformulation allows us to recast the problem as a set of independent tasks, and exploit data locality to reduce global communication. We discuss two different parallel implementations: (a) a single program multiple data (SPMD) version based on a one-to-one mapping between subdomain and MPI processes responsible for both state and computation;more »« less
https://doi.org/10.1177/1094342016684975

Full Text Available
On Deciding between Conservative and Optimistic Approaches on Massively Parallel Platforms

Conference Carothers, Prof. Christopher D. ; Perumalla, Kalyan S

Over 5000 publications on parallel discrete event simulation (PDES) have appeared in the literature to date. Nevertheless, few articles have focused on empirical studies of PDES performance on large supercomputer-based systems. This gap is bridged here, by undertaking a parameterized performance study on thousands of processor cores of a Blue Gene supercomputing system. In contrast to theoretical insights from analytical studies, our study is based on actual implementation in software, incurring the actual messaging and computational overheads for both conservative and optimistic synchronization approaches of PDES. Complex and counter-intuitive effects are uncovered and analyzed, with different event timestamp distributions andmore »« less

Similar Records