Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA simple asynchronous replica-exchange implementation
100
0
0.0
(
0
)
Authors
Giovanni Bussi
Ask ChatGPT about the research
No Arabic abstract
We discuss the possibility of implementing asynchronous replica-exchange (or parallel tempering) molecular dynamics. In our scheme, the exchange attempts are driven by asynchronous messages sent by one of the computing nodes, so that different replicas are allowed to perform a different number of time-steps between subsequent attempts. The implementation is simple and based on the message-passing interface (MPI). We illustrate the advantages of our scheme with respect to the standard synchronous algorithm and we benchmark it for a model Lennard-Jones liquid on an IBM-LS21 blade center cluster.
rate research
Read More
The computational study of conformational transitions in RNA and proteins with atomistic molecular dynamics often requires suitable enhanced sampling techniques. We here introduce a novel method where concurrent metadynamics are integrated in a Hamiltonian replica-exchange scheme. The ladder of replicas is built with different strength of the bias potential exploiting the tunability of well-tempered metadynamics. Using this method, free-energy barriers of individual collective variables are significantly reduced compared with simple force-field scaling. The introduced methodology is flexible and allows adaptive bias potentials to be self-consistently constructed for a large number of simple collective variables, such as distances and dihedral angles. The method is tested on alanine dipeptide and applied to the difficult problem of conformational sampling in a tetranucleotide.
New hardware architectures open up immense opportunities for supercomputer simulations. However, programming techniques for different architectures vary significantly, which leads to the necessity of developing and supporting multiple co
Redox processes are important in chemistry, with applications in biomedicine, chemical analysis, among others. As many redox experiments are also performed at a fixed value of pH, having an efficient computational method to support experimental measures at both constant redox potential and pH is very important. Such computational techniques have the potential to validate experimental observations performed under these conditions and to provide additional information unachievable experimentally such as an atomic level description of macroscopic measures. We present the implementation of discrete redox and protonation states methods for constant redox potential Molecular Dynamics (CEMD), for coupled constant pH and constant redox potential MD (C(pH,E)MD), and for Replica Exchange MD along the redox potential dimension (E-REMD) on the AMBER software package. Validation results are presented for a small system that contains a single heme group: N-acetylmicroperoxidase-8 (NAcMP8) axially connected to a histidine peptide. The methods implemented allow one to make standard redox potential (Eo) predictions with the same easiness and accuracy as pKa predictions using the constant pH molecular dynamics and pH-REMD methods currently available on AMBER. In our simulations, we can correctly describe, in agreement also with theoretical predictions, the following behaviors: when a redox-active group is reduced, the pKa of a near pH-active group increases because it becomes easier for a proton to be attached; equivalently, when a pH-active group is protonated, the Eo of an adjacent redox-active group rises. Furthermore, our results also show that E-REMD is able to achieve faster statistical convergence than CEMD or C(pH,E)MD. Moreover, computational benchmarks using our methodologies show high-performance of GPU accelerated calculations in comparison to conventional CPU calculations.
This paper presents an asynchronous incremental aggregated gradient algorithm and its implementation in a parameter server framework for solving regularized optimization problems. The algorithm can handle both general convex (possibly non-smooth) regularizers and general convex constraints. When the empirical data loss is strongly convex, we establish linear convergence rate, give explicit expressions for step-size choices that guarantee convergence to the optimum, and bound the associated convergence factors. The expressions have an explicit dependence on the degree of asynchrony and recover classical results under synchronous operation. Simulations and implementations on commercial compute clouds validate our findings.
The parallel annealing method is one of the promising approaches for large scale simulations as potentially scalable on any parallel architecture. We present an implementation of the algorithm on the hybrid program architecture combining CUDA and MPI. The problem is to keep all general-purpose graphics processing unit devices as busy as possible redistributing replicas and to do that efficiently. We provide details of the testing on Intel Skylake/Nvidia V100 based hardware running in parallel more than two million replicas of the Ising model sample. The results are quite optimistic because the acceleration grows toward the perfect line with the growing complexity of the simulated system.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
