## Abstract We describe an algorithm for computing nonbonded interactions with cutoffs on a graphics processing unit. We have incorporated it into OpenMM, a library for performing molecular simulations on highβperformance computer architectures. We benchmark it on a variety of systems including box
Performance enhancements for GROMACS nonbonded interactions on BlueGene
β Scribed by Mark J. Abraham
- Book ID
- 102306111
- Publisher
- John Wiley and Sons
- Year
- 2011
- Tongue
- English
- Weight
- 83 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0192-8651
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
Several improvements to the previously optimized GROMACS BlueGene inner loops that evaluate nonbonded interactions in molecular dynamics simulations are presented. The new improvements yielded an 11% decrease in running time for both PME and other kinds of GROMACS simulations that use nonbonded table lookβups. Some other GROMACS simulations will show a small gain. Β© 2011 Wiley Periodicals, Inc. J Comput Chem, 2011
π SIMILAR VOLUMES
Recent advances in protein design have demonstrated the effectiveness of optimization algorithms based on the dead-end elimination theorem. The algorithms solve the combinatorial problem of finding the optimal placement of side chains for a set of backbone coordinates. Although they are powerful too
This paper considers the implementation of a neural network development environment, and describes a prototype that has been produced. The prototype has been targeted at pattern classifier applications, where human support can be beneficial. The initial aim of the system is to provide support for ge
Below we offer evidence based on photoelectron(pe)spectros that bicycle E.2.3 nona-2,4,7-trien-g-one 2'3 (3) is not a bicycloconjugated (bicyclo-