Jump to content

OpenAtom

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Bhatele (talk | contribs) at 22:42, 3 January 2008 (Created page with ''''LeanCP''' is a massively parallel quantum chemistry application written in Charm++ for simulations on supercomputers. Many important problems in [[materi...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

LeanCP is a massively parallel quantum chemistry application written in Charm++ for simulations on supercomputers. Many important problems in material science, chemistry, solid-state physics, and biophysics require a modeling approach based on fundamental quantum mechanical principles. A particular approach that has proved to be relatively efficient and useful is Car-Parrinello ab initio molecular dynamics (CPAIMD). It is widely used to study systems consisting of hundreds to thousands of atoms. CPAIMD computations involve a large number of interdependent phases with high communication overhead including multiple concurrent sparse 3D Fast Fourier Transforms (3D-FFTs), non-square matrix multiplies and few concurrent dense 3D-FFTs.

Parallelization of this approach beyond a few hundred processors is challenging, due to the complex dependencies among various subcomputations, which lead to complex communication optimization and load balancing problems. Using Charm++ and its concept of processor virtualization, the phases are discretized into a large number of virtual processors which are, in turn, mapped flexibly onto physical processors, thereby allowing significant interleaving of work. Interleaving is enhanced through both architecturally independent methods and network topology aware mapping techniques. LeanCP has shown good scaling up to 20,480 processors of IBM's Blue Gene/L and 4,096 processors of Cray XT3.

LeanCP is freely available for download at the Charm++ website. Published papers can also be found at the website.

See also