An adaptive non-blocking GVT algorithm

Eric Mikida, Laxmikant Kale

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In optimistic Parallel Discrete Event Simulations (PDES), the Global Virtual Time (GVT) computation is an important aspect of performance. It must be performed frequently enough to ensure simulation progress and free memory, while still incurring minimal overhead. Many algorithms have been studied for computing the GVT eciently under a variety of simulation conditions for a variety of models. In this paper we propose a new GVT algorithm which aims to do two things. First, it incurs a very low overhead on the simulation by not requiring the simulation to block execution. Secondly, and most importantly, it has the ability to adapt to simulation conditions while it’s running. This allows it to perform well for a variety of models, and helps remove some burden from developers by not requiring intensive tuning.

Original languageEnglish (US)
Title of host publicationSIGSIM-PADS 2019 - Proceedings of the 2019 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation
PublisherAssociation for Computing Machinery
Pages25-36
Number of pages12
ISBN (Electronic)9781450367233
DOIs
StatePublished - May 29 2019
Event2019 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, SIGSIM-PADS 2019 - Chicago, United States
Duration: Jun 3 2019Jun 5 2019

Publication series

NameSIGSIM-PADS 2019 - Proceedings of the 2019 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation

Conference

Conference2019 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, SIGSIM-PADS 2019
Country/TerritoryUnited States
CityChicago
Period6/3/196/5/19

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Modeling and Simulation

Fingerprint

Dive into the research topics of 'An adaptive non-blocking GVT algorithm'. Together they form a unique fingerprint.

Cite this