Fewer Faults for Faster Computing

Mar 28, 2011
The redundant data distribution of an array showing that a node failure will leave at least one copy of the data available for continued execution. This is the basic idea that enables the approach, which can be used in many science domains.

(PhysOrg.com) -- Environmental Molecular Sciences Laboratory (EMSL) users have designed and implemented an efficient fault-tolerant version of the coupled cluster method for high-performance computational chemistry using in-memory data redundancy.

Their method, demonstrated with the EMSL-developed and now NWChem, addresses the challenges of reduced mean time between failures, which is currently days and projected to be hours for upcoming extreme scale supercomputers.

Their approach with coupled cluster perturbative triples enables the program to correctly continue execution despite the loss of processes.

The team extended the Global Array toolkit, a library that provides an efficient and portable “shared-memory” programming interface for distributed-memory computers.

Each process in a Multiple Instruction/Multiple Data parallel program can asynchronously access logical blocks of physically distributed dense multidimensional arrays, without requiring cooperation by other processes.

The infrastructure that the team developed was shown to add an overhead of less than 10% and can be deployed to other algorithms throughout NWChem as well as other codes. Such advances in supercomputing will enhance scientific capability to address global challenges such as climate change and energy solutions using top-end computing platforms.

Explore further: Computer-assisted authoring tools help to create complex interactive narratives

More information: van Dam HJJ, A Vishnu, and WA de Jong. 2011. “Designing a Scalable Fault Tolerance Model for High Performance Computational Chemistry: A Case Study with Coupled Cluster Perturbative Triples.” J. Chem. Theory Comput. 2011, 7, 66–75. DOI:10.1021/ct100439u

add to favorites email to friend print save as pdf

Related Stories

Scaling Goes eXtreme: Researchers reach 34K CPUs

May 25, 2010

(PhysOrg.com) -- Currently, researchers have demonstrated the scalability of high-level excited-state coupled-cluster approaches and parallel-in-time algorithms, reaching a staggering 34,000 Core Processing ...

Customizing supercomputers from the ground up

May 27, 2010

(PhysOrg.com) -- Computer scientist Adolfy Hoisie has joined the Department of Energy's Pacific Northwest National Laboratory to lead PNNL's high performance computing activities. In one such activity, Hoisie will direct ...

Recommended for you

New paper focuses on degree centrality in networks

Feb 26, 2015

Social networks such as Facebook, LinkedIn and Twitter play an increasingly central role in our lives. Centrality is also an important concept in the theory of social networks. Centrality of an individual, called a "node" ...

Linguists tackle computational analysis of grammar

Feb 26, 2015

Children don't have to be told that "cat" and "cats" are variants of the same word—they pick it up just by listening. To a computer, though, they're as different as, well, cats and dogs. Yet it's computers ...

User comments : 0

Please sign in to add a comment. Registration is free, and takes less than a minute. Read more

Click here to reset your password.
Sign in to get notified via email when new comments are made.