## Abstract We describe two algorithms for the parallel calculation of a CHARMm‐like force field in macromolecules. For a molecule with a given number of atoms, we show that there is an optimal number of processors leading to a minimum computation time. At the optimum, both the number of processors
Protein calculations on parallel processors. I. Parallel algorithm for the potential energy
✍ Scribed by J.F. Janak; P.C. Pattnaik
- Publisher
- John Wiley and Sons
- Year
- 1992
- Tongue
- English
- Weight
- 609 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0192-8651
No coin nor oath required. For personal study only.
✦ Synopsis
We investigate and test an algorithm suitable for the parallel calculation of the potential energy of a protein, or its spatial gradient, when the protein atoms interact via pair potentials. This algorithm is similar to one previously proposed, but it is more efficient, having half the interprocessor communications costs. For a given protein, we show that there is an optimal number of processors that gives a maximum speedup of the potential energy calculation compared to a sequential machine. (Using more than the optimum number of processors actually increases the computation time). With the optimum number the computation time is proportional to the protein size N. This is a considerable improvement in performance compared to sequential machines, where the computation time is proportional to N2. We also show that the dependence of the maximum speedup on the message latency time is relatively weak.
📜 SIMILAR VOLUMES
TRAX-I, a cost-effective parallel microcomputer, applying associative string processor (ASP) architecture with 16 K parallel processing elements, is being built by Aspex Microsystems Ltd. (UK). When applied to the tracking problem of very complex events with several hundred tracks, the large number
## Abstract We present the parallel version of a previous serial algorithm for the efficient calculation of canonical MP2 energies (Pulay, P.; Saebo, S.; Wolinski, K. Chem Phys Lett 2001, 344, 543). It is based on the Saebo–Almlöf direct‐integral transformation, coupled with an efficient prescreeni