Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Publications

Physics

Parallel computing

Publication Year

Articles 1 - 2 of 2

Full-Text Articles in Physical Sciences and Mathematics

Continuous Development Of Schemes For Parallel Computing Of The Electrostatics In Biological Systems: Implementation In Delphi, Chuan Li, Marharyta Petukh, Lin Li, Emil Alexov Jun 2013

Continuous Development Of Schemes For Parallel Computing Of The Electrostatics In Biological Systems: Implementation In Delphi, Chuan Li, Marharyta Petukh, Lin Li, Emil Alexov

Publications

Due to the enormous importance of electrostatics in molecular biology, calculating the electrostatic potential and corresponding energies has become a standard computational approach for the study of biomolecules and nano-objects immersed in water and salt phase or other media. However, the electrostatics of large macromolecules and macromolecular complexes, including nano-objects, may not be obtainable via explicit methods and even the standard continuum electrostatics methods may not be applicable due to high computational time and memory requirements. Here, we report further development of the parallelization scheme reported in our previous work (J Comput Chem. 2012 Sep 15; 33(24):1960–6.) to include parallelization …


Highly Efficient And Exact Method For Parallelization Of Grid-Based Algorithms And Its Implementation In Delphi, Chuan Li, Lin Li, Jie Zhang, Emil Alexov Sep 2012

Highly Efficient And Exact Method For Parallelization Of Grid-Based Algorithms And Its Implementation In Delphi, Chuan Li, Lin Li, Jie Zhang, Emil Alexov

Publications

The Gauss–Seidel (GS) method is a standard iterative numerical method widely used to solve a system of equations and, in general, is more efficient comparing to other iterative methods, such as the Jacobi method. However, standard implementation of the GS method restricts its utilization in parallel computing due to its requirement of using updated neighboring values (i.e., in current iteration) as soon as they are available. Here, we report an efficient and exact (not requiring assumptions) method to parallelize iterations and to reduce the computational time as a linear/nearly linear function of the number of processes or computing units. In …