It is common practice in molecular dynamics and Monte Carlo computer simulations to run multiple, separately-initialized simulations in order to improve the sampling of independent microstates. Here we examine the utility of an extreme case of this strategy, in which we run a large ensemble of M independent simulations (a ``swarm''), each of which is relaxed to equilibrium. We show that if M is of order , we can monitor the swarm's relaxation to equilibrium, and confirm its attainment, within , where is the equilibrium relaxation time. As soon as a swarm of this size attains equilibrium, the ensemble of M final microstates from each run is sufficient for the evaluation of most equilibrium properties without further sampling. This approach dramatically reduces the wall-clock time required, compared to a single long simulation, by a factor of several hundred, at the cost of an increase in the total computational effort by a small factor. It is also well suited to modern computing systems having thousands of processors, and is a viable strategy for simulation studies that need to produce high-precision results in a minimum of wall-clock time. We present results obtained by applying this approach to several test cases.
``Swarm relaxation'': Equilibrating a large ensemble of computer simulations / Malek, Shahrazad M. A.; Bowles, Richard K.; Saika-Voivod, Ivan; Sciortino, Francesco; Poole, Peter H.. - In: THE EUROPEAN PHYSICAL JOURNAL. E, SOFT MATTER. - ISSN 1292-8941. - 40:11(2017). [10.1140/epje/i2017-11588-2]
``Swarm relaxation'': Equilibrating a large ensemble of computer simulations
Sciortino, Francesco;
2017
Abstract
It is common practice in molecular dynamics and Monte Carlo computer simulations to run multiple, separately-initialized simulations in order to improve the sampling of independent microstates. Here we examine the utility of an extreme case of this strategy, in which we run a large ensemble of M independent simulations (a ``swarm''), each of which is relaxed to equilibrium. We show that if M is of order , we can monitor the swarm's relaxation to equilibrium, and confirm its attainment, within , where is the equilibrium relaxation time. As soon as a swarm of this size attains equilibrium, the ensemble of M final microstates from each run is sufficient for the evaluation of most equilibrium properties without further sampling. This approach dramatically reduces the wall-clock time required, compared to a single long simulation, by a factor of several hundred, at the cost of an increase in the total computational effort by a small factor. It is also well suited to modern computing systems having thousands of processors, and is a viable strategy for simulation studies that need to produce high-precision results in a minimum of wall-clock time. We present results obtained by applying this approach to several test cases.File | Dimensione | Formato | |
---|---|---|---|
Malek_“Swarm relaxation_2017.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
615.6 kB
Formato
Adobe PDF
|
615.6 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.