![]() |
There are two ways in which parallel tempering can speed up a simulation. First, it may allow the system to equilibrate faster, as illustrated in Figure 9. Here, a single MC run with traditional Metropolis moves (at ) is started from the same initial configurations as a parallel tempering run with 8 replicas. The parallel tempering simulation reaches a stable equilibrium nearly
times faster. Hence, the utility of parallel tempering in solving for the equilibrium sturctures of systems with frustrated geometries [4].
For an already equilibrated system, simulations can still be inefficient if configurations have a very long autocorrelation time. If parallel tempering can reduce the autocorrelation significantly, it could prove very useful for simulations of complex liquids like water. The estimated error in the mean from a set of data points is
, where
is the variance of the mean,
is the number of sample points, and
is the autocorrelation time. If we have access to
processors, we can run
independent MC simulations of
samples each and reduce the error estimate by
. To beat this `` trivially parallel'' performance, a parallel tempering algorithm run on
processors would have to reduce the autocorrelation time by a factor greater than
to be useful. Our initial results (Figure 10) do not indicate such a performance boost, but they are inconclusive at this point.
![]() |