Publications

Hulette, Geoffrey C.; Mayo, Jackson M.; Morris Wright, Karla V.

Abstract not provided.

Rizzi, Francesco N.; Morris Wright, Karla V.; Sargsyan, Khachik S.; Mycek, Paul M.; Safta, Cosmin S.; Le Maitre, Olivier L.; Knio, Omar K.; Debusschere, Bert D.

Abstract not provided.

Rizzi, Francesco N.; Morris Wright, Karla V.; Sargsyan, Khachik S.; Mycek, Paul M.; Safta, Cosmin S.; Le Maitre, Olivier L.; Knio, Omar K.; Debusschere, Bert D.

Abstract not provided.

Rizzi, Francesco N.; Morris Wright, Karla V.; Sargsyan, Khachik S.; Mycek, Paul M.; Safta, Cosmin S.; Le Maitre, Olivier L.; Knio, Omar K.; Debusschere, Bert D.

Abstract not provided.

Morris Wright, Karla V.; Rizzi, Francesco N.; Sargsyan, Khachik S.; Dahlgren, Kathryn D.; Mycek, Paul M.; Safta, Cosmin S.; Le Maitre, Olivier L.; Knio, Omar K.; Debusschere, Bert D.

Abstract not provided.

Morris Wright, Karla V.; Rizzi, Francesco N.; Sargsyan, Khachik S.; Mycek, Paul M.; Safta, Cosmin S.; LeMaitre, Olivier L.; Knio, Omar K.; Debusschere, Bert D.

Abstract not provided.

Rizzi, Francesco N.; Morris Wright, Karla V.; Sargsyan, Khachik S.; Mycek, Paul M.; Safta, Cosmin S.; Le Maitre, Olivier L.; Knio, Omar K.; Debusschere, Bert D.

We discuss algorithm-based resilience to silent data corruption (SDC) in a task- based domain-decomposition preconditioner for partial differential equations (PDEs). The algorithm exploits a reformulation of the PDE as a sampling problem, followed by a solution update through data manipulation that is resilient to SDC. The imple- mentation is based on a server-client model where all state information is held by the servers, while clients are designed solely as computational units. Scalability tests run up to [?] 51 K cores show a parallel efficiency greater than 90%. We use a 2D elliptic PDE and a fault model based on random single bit-flip to demonstrate the resilience of the application to synthetically injected SDC. We discuss two fault scenarios: one based on the corruption of all data of a target task, and the other involving the corrup- tion of a single data point. We show that for our application, given the test problem considered, a four-fold increase in the number of faults only yields a 2% change in the overhead to overcome their presence, from 7% to 9%. We then discuss potential savings in energy consumption via dynamics voltage/frequency scaling, and its interplay with fault-rates, and application overhead. [?] Sandia National Laboratories, Livermore, CA ( fnrizzi@sandia.gov ). + Sandia National Laboratories, Livermore, CA ( knmorri@sandia.gov ). ++ Sandia National Laboratories, Livermore, CA ( ksargsy@sandia.gov ). SS Duke University, Durham, NC ( paul.mycek@duke.edu ). P Sandia National Laboratories, Livermore, CA ( csafta@sandia.gov ). k Laboratoire d'Informatique pour la M'ecanique et les Sciences de l'Ing'enieur, Orsay, France ( olm@limsi.fr ). [?][?] Duke University, Durham, NC ( omar.knio@duke.edu ). ++ Sandia National Laboratories, Livermore, CA ( bjdebus@sandia.gov ).

Rizzi, Francesco N.; Morris Wright, Karla V.; Sargsyan, Khachik S.; Safta, Cosmin S.; Mycek, Paul M.; Le Maitre, Olivier L.; Knio, Omar K.; Debusschere, Bert D.

Abstract not provided.

Rizzi, Francesco N.; Morris Wright, Karla V.; Sargsyan, Khachik S.; Mycek, Paul M.; Safta, Cosmin S.; Le Maitre, Olivier L.; Knio, Omar K.; Debusschere, Bert D.

Abstract not provided.

Rizzi, Francesco N.; Morris Wright, Karla V.; Sargsyan, Khachik S.; Mycek, Paul M.; Safta, Cosmin S.; Le Maitre, Olivier L.; Knio, Omar K.; Debusschere, Bert D.

Abstract not provided.

Proceedings - IEEE International Conference on Cluster Computing, ICCC

Rizzi, Francesco N.; Morris Wright, Karla V.; Sargsyan, Khachik S.; Mycek, Paul; Safta, Cosmin S.; Le Maitre, Olivier; Knio, Omar; Debusschere, Bert D.

We present a domain-decomposition-based pre-conditioner for the solution of partial differential equations (PDEs) that is resilient to both soft and hard faults. The algorithm is based on the following steps: first, the computational domain is split into overlapping subdomains, second, the target PDE is solved on each subdomain for sampled values of the local current boundary conditions, third, the subdomain solution samples are collected and fed into a regression step to build maps between the subdomains' boundary conditions, finally, the intersection of these maps yields the updated state at the subdomain boundaries. This reformulation allows us to recast the problem as a set of independent tasks. The implementation relies on an asynchronous server-client framework, where one or more reliable servers hold the data, while the clients ask for tasks and execute them. This framework provides resiliency to hard faults such that if a client crashes, it stops asking for work, and the servers simply distribute the work among all the other clients alive. Erroneous subdomain solves (e.g. due to soft faults) appear as corrupted data, which is either rejected if that causes a task to fail, or is seamlessly filtered out during the regression stage through a suitable noise model. Three different types of faults are modeled: hard faults modeling nodes (or clients) crashing, soft faults occurring during the communication of the tasks between server and clients, and soft faults occurring during task execution. We demonstrate the resiliency of the approach for a 2D elliptic PDE, and explore the effect of the faults at various failure rates.

Rizzi, Francesco N.; Morris Wright, Karla V.; Debusschere, Bert D.

Abstract not provided.

Templeton, Jeremy A.; Morris Wright, Karla V.; Erickson, Lindsay C.

Abstract not provided.

Rizzi, Francesco N.; Morris Wright, Karla V.; Sargsyan, Khachik S.; Mycek, Paul M.; Safta, Cosmin S.; LeMaitre, Olivier L.; Knio, Omar K.; Debusschere, Bert D.

Abstract not provided.

Rizzi, Francesco N.; Morris Wright, Karla V.; Sargsyan, Khachik S.; Mycek, Paul M.; Safta, Cosmin S.; LeMaitre, Olivier L.; Knio, Omar K.; Najm, H.N.; Debusschere, Bert D.

Abstract not provided.

Dahlgren, Kathryn M.; Rizzi, Francesco N.; Morris Wright, Karla V.; Debusschere, Bert D.

Abstract not provided.

Squibb, Jonathan M.; Debusschere, Bert D.; Rizzi, Francesco N.; Morris Wright, Karla V.

Abstract not provided.

Dahlgren, Kathryn M.; Rizzi, Francesco N.; Morris Wright, Karla V.; Debusschere, Bert D.

Abstract not provided.

Sargsyan, Khachik S.; Sargsyan, Khachik S.; Safta, Cosmin S.; Safta, Cosmin S.; Debusschere, Bert D.; Debusschere, Bert D.; Najm, H.N.; Najm, H.N.; Rizzi, Francesco N.; Rizzi, Francesco N.; Morris Wright, Karla V.; Morris Wright, Karla V.; Mycek, Paul M.; Mycek, Paul M.; Maitre, Olivier L.; Maitre, Olivier L.; Knio, Omar K.; Knio, Omar K.

The move towards extreme-scale computing platforms challenges scientific simula- tions in many ways. Given the recent tendencies in computer architecture development, one needs to reformulate legacy codes in order to cope with large amounts of commu- nication, system faults and requirements of low-memory usage per core. In this work, we develop a novel framework for solving partial differential equa- tions (PDEs) via domain decomposition that reformulates the solution as a state-of- knowledge with a probabilistic interpretation. Such reformulation allows resiliency with respect to potential faults without having to apply fault detection, avoids unnecessary communication and is generally well-positioned for rigorous uncertainty quantification studies that target improvements of predictive fidelity of scientific models. We demon- strate our algorithm for one-dimensional PDE examples where artificial faults have been implemented as bit-flips in the binary representation of subdomain solutions. *Sandia National Laboratories, 7011 East Ave, MS 9051, Livermore, CA 94550 (ksargsy@sandia.gov). t Sandia National Laboratories, Livermore, CA (fnrizzi@sandia.gov). IDuke University, Durham, NC (paul .mycek@duke . edu). Sandia National Laboratories, Livermore, CA (csaft a@sandia.gov). i llSandia National Laboratories, Livermore, CA (knmorri@sandia.gov). II Sandia National Laboratories, Livermore, CA (hnnajm@sandia.gov). **Laboratoire d'Informatique pour la Mecanique et les Sciences de l'Ingenieur, Orsay, France (olm@limsi . f r). ttDuke University, Durham, NC (omar . knio@duke . edu). It Sandia National Laboratories, Livermore, CA (bjdebus@sandia.gov).

Rizzi, Francesco N.; Morris Wright, Karla V.; Sargsyan, Khachik S.; Safta, Cosmin S.; Mycek, Paul M.; LeMaitre, Olivier L.; Najm, H.N.; Knio, Omar K.; Debusschere, Bert D.

Abstract not provided.

Rizzi, Francesco N.; Morris Wright, Karla V.; Sargsyan, Khachik S.; Mycek, Paul M.; Safta, Cosmin S.; LeMaitre, Olivier L.; Knio, Omar K.; Najm, H.N.; Debusschere, Bert D.

Abstract not provided.

Scientific Programming

Morris Wright, Karla V.

Although the high-performance computing (HPC) community increasingly embraces object-oriented programming (OOP), most HPC OOP projects employ the C++ programming language. Until recently, Fortran programmers interested in mining the benefits of OOP had to emulate OOP in Fortran 90/95. The advent of widespread compiler support for Fortran 2003 now facilitates explicitly constructing object-oriented class hierarchies via inheritance and leveraging related class behaviors such as dynamic polymorphism. Although C++ allows a class to inherit from multiple parent classes, Fortran and several other OOP languages restrict or prohibit explicit multiple inheritance relationships in order to circumvent several pitfalls associated with them. Nonetheless, what appears as an intrinsic feature in one language can be modeled as a user-constructed design pattern in another language. The present paper demonstrates how to apply the facade structural design pattern to support a multiple inheritance class relationship in Fortran 2003. The design unleashes the power of the associated class relationships for modeling complicated data structures yet avoids the ambiguities that plague some multiple inheritance scenarios.

Dahlgren, Kathryn M.; Rizzi, Francesco N.; Morris Wright, Karla V.; Debusschere, Bert D.

The future of extreme-scale computing is expected to magnify the influence of soft faults as a source of inaccuracy or failure in solutions obtained from distributed parallel computations. The development of resilient computational tools represents an essential recourse for understanding the best methods for absorbing the impacts of soft faults without sacrificing solution accuracy. The Rexsss (Resilient Extreme Scale Scientific Simulations) project pursues the development of fault resilient algorithms for solving partial differential equations (PDEs) on distributed systems. Performance analyses of current algorithm implementations assist in the identification of runtime inefficiencies.

Rizzi, Francesco N.; Sargsyan, Khachik S.; Debusschere, Bert D.; Safta, Cosmin S.; Morris Wright, Karla V.; Knio, Omar K.; Najm, H.N.

Abstract not provided.

Dahlgren, Kathryn M.; Rizzi, Francesco N.; Morris Wright, Karla V.; Debusschere, Bert D.

Abstract not provided.