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

Coupling the time-warp algorithm with the graph-theoretical kinetic Monte Carlo framework for distributed simulations of heterogeneous catalysts

Ravipati, S; Savva, GD; Christidi, I; Guichard, R; Nielsen, J; Reocreux, R; Stamatakis, M; (2022) Coupling the time-warp algorithm with the graph-theoretical kinetic Monte Carlo framework for distributed simulations of heterogeneous catalysts. Computer Physics Communications , 270 , Article 108148. 10.1016/j.cpc.2021.108148. Green open access

[thumbnail of Stamatakis_1-s2.0-S0010465521002605-main.pdf]
Preview
Text
Stamatakis_1-s2.0-S0010465521002605-main.pdf - Accepted Version

Download (1MB) | Preview

Abstract

Despite the successful and ever widening adoption of kinetic Monte Carlo (KMC) simulations in the area of surface science and heterogeneous catalysis, the accessible length scales are still limited by the inherently sequential nature of the KMC framework. Simulating long-range surface phenomena, such as catalytic reconstruction and pattern formation, requires consideration of large surfaces/lattices, at the μm scale and beyond. However, handling such lattices with the sequential KMC framework is extremely challenging due to the heavy memory footprint and computational demand. The Time-Warp algorithm proposed by Jefferson [ACM. Trans. Program. Lang. Syst., 1985. 7: 404-425] offers a way to enable distributed parallelization of discrete event simulations. Thus, to enable high-fidelity simulations of challenging systems in heterogeneous catalysis, we have coupled the Time-Warp algorithm with the Graph-Theoretical KMC framework [J. Chem. Phys., 134(21): 214115; J. Chem. Phys., 139(22): 224706] and implemented the approach in the general-purpose KMC code Zacros. We have further developed a “parallel-emulation” serial algorithm, which produces identical results to those obtained from the distributed runs (with the Time-Warp algorithm) thereby validating the correctness of our implementation. These advancements make Zacros the first-of-its-kind general-purpose KMC code with distributed computing capabilities, thereby opening up opportunities for detailed meso-scale studies of heterogeneous catalysts and closer-than-ever comparisons of theory with experiments.

Type: Article
Title: Coupling the time-warp algorithm with the graph-theoretical kinetic Monte Carlo framework for distributed simulations of heterogeneous catalysts
Open access status: An open access version is available from UCL Discovery
DOI: 10.1016/j.cpc.2021.108148
Publisher version: https://doi.org/10.1016/j.cpc.2021.108148
Language: English
Additional information: This version is the author accepted manuscript. For information on re-use, please refer to the publisher's terms and conditions.
Keywords: Kinetic Monte Carlo, Lattice, Time-warp algorithm, Catalysis, Materials science, Distributed simulation
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
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences > Dept of Physics and Astronomy
URI: https://discovery.ucl.ac.uk/id/eprint/10133698
Downloads since deposit
60Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item