Hybrid asynchronous algorithm for parallel kinetic Monte Carlo simulations of thin film growth (Q2576306)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Hybrid asynchronous algorithm for parallel kinetic Monte Carlo simulations of thin film growth |
scientific article; zbMATH DE number 2241356
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hybrid asynchronous algorithm for parallel kinetic Monte Carlo simulations of thin film growth |
scientific article; zbMATH DE number 2241356 |
Statements
Hybrid asynchronous algorithm for parallel kinetic Monte Carlo simulations of thin film growth (English)
0 references
27 December 2005
0 references
The authors find that, except for 1D simulations in which relatively large system sizes are typically used, for the typical parameters and processor and system sizes in epitaxial growth simulations, the parallel efficiency of the ``hybrid'' algorithm is significantly limited by three main effects: -- the high probability of selecting a boundary Metropolis Monte Carlo (MMC) move which is due to the large range of rate in thin-film growth; -- the low acceptance probability of boundary MMC moves; -- the requirement of interprocessor communication before each boundary MMC move. The hybrid algorithm does not appear to offer an efficient simulation method for parallel kinetic Monte Carlo simulations of epitaxial grouth except at relatively low temperatures.
0 references
parallel kinetic Monte Carlo
0 references
hybrid asynchronous algorithm
0 references
thin-film growth
0 references
0 references
0 references
0 references
0.9042212
0 references
0.87696624
0 references
0.87562746
0 references
0.8590948
0 references
0.85840464
0 references