UCL Discovery Stage
UCL home » Library Services » Electronic resources » UCL Discovery Stage

Large-scale benchmarks of the Time-Warp/Graph-Theoretical Kinetic Monte Carlo approach for distributed on-lattice simulations of catalytic kinetics

Stamatakis, Michail; Benson, Raz Lior; Savva, Giannis D; Christidi, Ilektra-Athanasia; (2023) Large-scale benchmarks of the Time-Warp/Graph-Theoretical Kinetic Monte Carlo approach for distributed on-lattice simulations of catalytic kinetics. Physical Chemistry Chemical Physics 10.1039/D2CP04424B. (In press). Green open access

[thumbnail of Stamatakis_Large-scale benchmarks of the Time-Warp_Graph-Theoretical Kinetic Monte Carlo approach for distributed on-lattice simulations of catalytic kinetics_AOP.pdf]
Preview
Text
Stamatakis_Large-scale benchmarks of the Time-Warp_Graph-Theoretical Kinetic Monte Carlo approach for distributed on-lattice simulations of catalytic kinetics_AOP.pdf

Download (4MB) | Preview

Abstract

We extend the work of Ravipati et al.[Comput. Phys. Commun., 2022, 270, 108148] in benchmarking the performance of large-scale, distributed, on-lattice kinetic Monte Carlo (KMC) simulations. Our software package, Zacros, employs a graph-theoretical approach to KMC, coupled with the Time-Warp algorithm for parallel discrete event simulations. The lattice is divided into equal subdomains, each assigned to a single processor; the cornerstone of the Time-Warp algorithm is the state queue, to which snapshots of the KMC (lattice) state are saved regularly, enabling historical KMC information to be corrected when conflicts occur at the subdomain boundaries. Focusing on three model systems, we highlight the key Time-Warp parameters that can be tuned to optimise KMC performance. The frequency of state saving, controlled by the state saving interval, δsnap, is shown to have the largest effect on performance, which favours balancing the overhead of re-simulating KMC history with that of writing state snapshots to memory. Also important is the global virtual time (GVT) computation interval, ΔτGVT, which has little direct effect on the progress of the simulation but controls how often the state queue memory can be freed up. We find that a vector data structure is, in general, more favourable than a linked list for storing the state queue, due to the reduced time required for allocating and de-allocating memory. These findings will guide users in maximising the efficiency of Zacros or other distributed KMC software, which is a vital step towards realising accurate, meso-scale simulations of heterogeneous catalysis.

Type: Article
Title: Large-scale benchmarks of the Time-Warp/Graph-Theoretical Kinetic Monte Carlo approach for distributed on-lattice simulations of catalytic kinetics
Open access status: An open access version is available from UCL Discovery
DOI: 10.1039/D2CP04424B
Publisher version: https://doi.org/10.1039/D2CP04424B
Language: English
Additional information: © Royal Society of Chemistry 2023. This article is licensed under a Creative Commons Attribution 3.0 Unported Licence (https://creativecommons.org/licenses/by/3.0/).
UCL classification: UCL
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Chemical Engineering
URI: https://discovery-pp.ucl.ac.uk/id/eprint/10163223
Downloads since deposit
120Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item