CRIS Current Research Information System
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishWe present a new algorithm, called linked neighbour list (LNL), useful to substantially speed up off lattice Monte Carlo simulations of fluids by avoiding the computation of the molecular energy before every attempted move. We introduce a few variants of the LNL method targeted to minimise memory footprint or augment memory coherence and cache utilisation. Additionally, we present a few algorithms which drastically accelerate neighbour finding. We test our methods on the simulation of a dense offlattice Gay–Berne fluid subjected to periodic boundary conditions observing a speedup factor of about 2.5 with respect to a well-coded implementation based on a conventional link-cell. We provide several implementation details of the different key data structures and algorithms used in this work.
| Titolo: | The Linked Neighbour List (LNL) method for fast off-lattice Monte Carlo simulations of fluids | |
| Autore/i: | M. Mazzeo; M. Ricci; ZANNONI, CLAUDIO | |
| Autore/i Unibo: | ||
| Anno: | 2010 | |
| Rivista: | ||
| Digital Object Identifier (DOI): | http://dx.doi.org/10.1016/j.cpc.2009.11.006 | |
| Abstract: | We present a new algorithm, called linked neighbour list (LNL), useful to substantially speed up off lattice Monte Carlo simulations of fluids by avoiding the computation of the molecular energy before every attempted move. We introduce a few variants of the LNL method targeted to minimise memory footprint or augment memory coherence and cache utilisation. Additionally, we present a few algorithms which drastically accelerate neighbour finding. We test our methods on the simulation of a dense offlattice Gay–Berne fluid subjected to periodic boundary conditions observing a speedup factor of about 2.5 with respect to a well-coded implementation based on a conventional link-cell. We provide several implementation details of the different key data structures and algorithms used in this work. | |
| Data prodotto definitivo in UGOV: | 2010-12-19 19:02:50 | |
| Appare nelle tipologie: | 1.01 Articolo in rivista |
File in questo prodotto:
http://hdl.handle.net/11585/94826
Copyright © 2022