A GENERAL PARALLEL ALGORITHM FOR THE GENERATION OF MOLECULAR ELECTROSTATIC POTENTIAL MAPS

Application of rigorous bounds yields an algorithm approximately linear in the number of primitive Gaussians for the computation of the molecular electrostatic potential (MESP). Careful strategies for parallelization of this algorithm have been evolved. Linear as well as superlinear speedups have been achieved by effective load balancing, viz. even distribution of the workload amongst the worker processors. The parallel algorithm was tested on C2H4, C3H4, C3H6, C4H6, C6H6, C6H5NO2, and C10H8 molecules using 4-31G**, 4-31G and 3G basis sets. The generation of the MESP on 100 x 100 points, for any of these molecules, using the parallel algorithm requires less than 5 min on the 32-node INMOS T800-based Parsytec computing system.