Parallel recombinative simulated annealing: a genetic algorithm
Parallel Computing
Algorithm 806: SPRNG: a scalable library for pseudorandom number generation
ACM Transactions on Mathematical Software (TOMS)
Testing parallel random number generators
Parallel Computing
Massively Parallel Simulated Annealing Embedded with Downhill A SPMD Algorithm for Cluster Computing
IWCC '99 Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing
A decentralized parallel implementation for parallel tempering algorithm
Parallel Computing
Hi-index | 0.05 |
Parallel Tempering (PT), also known as Replica Exchange, is a powerful Markov Chain Monte Carlo sampling approach which aims at reducing the relaxation time in simulations of physical systems. In this paper, we present a novel implementation of PT, so-called decentralized replica exchange PT, using MPI and the Scalable Parallel Random Number Generators (SPRNG) libraries. By adjusting the replica exchange operations in the original PT algorithm, and taking advantage of the characteristics of pseudorandom number generators, this implementation minimizes the overhead caused by interprocessor communication in replica exchange in PT. This enables one to efficiently apply PT to large-scale massively parallel systems. The efficiency of this implementation has been demonstrated in the context of various benchmark energy functions, such as the high-dimensional Rosenbrock function, and a rugged funnel-like function.