Publications

Wilke, Jeremiah J.; Hollman, David S.; Lifflander, Jonathan

Abstract not provided.

Markosyan, Aram H.; Bettencourt, Matthew T.; Bennett, Janine C.; Lifflander, Jonathan; Hollman, David S.; Wilke, Jeremiah J.; Kolla, Hemanth K.; Moore, Christopher H.; Clay, Robert L.

Abstract not provided.

Markosyan, Aram H.; Bettencourt, Matthew T.; Bennett, Janine C.; Lifflander, Jonathan; Hollman, David S.; Wilke, Jeremiah J.; Kolla, Hemanth K.; Moore, Christopher H.; Clay, Robert L.

Abstract not provided.

Markosyan, Aram H.; Bettencourt, Matthew T.; Bennett, Janine C.; Lifflander, Jonathan; Hollman, David S.; Wilke, Jeremiah J.; Kolla, Hemanth K.; Moore, Christopher H.; Clay, Robert L.

Abstract not provided.

Rizzi, Francesco N.; Phipps, Eric T.; Hollman, David S.; Lifflander, Jonathan; Wilke, Jeremiah J.; Markosyan, Aram H.; Kolla, Hemanth K.; Slattengren, Nicole S.; Teranishi, Keita T.; Stewart, James R.; Clay, Robert L.; Bennett, Janine C.

Abstract not provided.

Hollman, David S.; D'Alessandro, Luke D.; Sterling, Thomas S.; Clay, Robert L.

Abstract not provided.

Bennett, Janine C.; Lifflander, Jonathan; Hollman, David S.; Wilke, Jeremiah J.; Kolla, Hemanth K.; Markosyan, Aram H.; Slattengren, Nicole S.; Clay, Robert L.

Abstract not provided.

Proceedings of ESPM2 2016: 2nd International Workshop on Extreme Scale Programming Models and Middleware - Held in conjunction with SC 2016: The International Conference for High Performance Computing, Networking, Storage and Analysis

Hollman, David S.; Bennett, Janine C.; Kolla, Hemanth K.; Lifflander, Jonathan; Slattengren, Nicole S.; Wilke, Jeremiah J.

Task-based execution models have received considerable attention in recent years to meet the performance challenges facing high-performance computing (HPC). In this paper we introduce MetaPASS-Metaprogramming-enabled Para-llelism from Apparently Sequential Semantics-a proof-of-concept, non-intrusive header library that enables implicit task-based parallelism in a sequential C++ code. MetaPASS is a data-driven model, relying on dependency analysis of variable read-/write accesses to derive a directed acyclic graph (DAG) of the computation to be performed. MetaPASS enables embedding of runtime dependency analysis directly in C++ applications using only template metaprogramming. Rather than requiring verbose task-based code or source-to-source compilers, a native C++ code can be made task-based with minimal modifications. We present an overview of the programming model enabled by MetaPASS and the C++ runtime API required to support it. Details are provided regarding how standard template metaprogramming is used to capture task dependencies. We finally discuss how the programming model can be deployed in both an MPI+X and in a standalone distributed memory context.

Lifflander, Jonathan; Hollman, David S.; Wilke, Jeremiah J.; Markosyan, Aram H.; Littlewood, David J.; Rizzi, Francesco N.; Bennett, Janine C.

Abstract not provided.

Wilke, Jeremiah J.; Hollman, David S.; Bennett, Janine C.; Lifflander, Jonathan; Kolla, Hemanth K.; Slattengren, Nicole S.

Abstract not provided.

Proceedings - 2016 IEEE 30th International Parallel and Distributed Processing Symposium, IPDPS 2016

Pébaÿ, Philippe; Bennett, Janine C.; Hollman, David S.; Treichler, Sean; McCormick, Patrick S.; Sweeney, Christine M.; Kolla, Hemanth K.; Aiken, Alex

We explore the use of asynchronous many-task (AMT) programming models for the implementation of in situ analysis towards the goal of maximizing programmer productivity and overall performance on next generation platforms. We describe how a broad class of statistics algorithms can be transformed from a traditional single-programm multiple-data (SPMD) implementation to an AMT implementation, demonstrating with a concrete example: a measurement of descriptive statistics implemented in Legion. Our experiments to quantify the benefit and possible drawbacks of this approach are in progress, and we present some encouraging initial results on the (minimal) impact of the AMT-based approach on code complexity, task scheduling, and application scalability.

Bennett, Janine C.; Wilke, Jeremiah J.; Hollman, David S.; Slattengren, Nicole L.; Kolla, Hemanth K.; Rizzi, Francesco N.; Teranishi, Keita T.; Clay, Robert L.

Abstract not provided.

Wilke, Jeremiah J.; Hollman, David S.; Slattengren, Nicole S.; Kolla, Hemanth K.; Rizzi, Francesco N.; Teranishi, Keita T.; Clay, Robert L.

Abstract not provided.

Wilke, Jeremiah J.; Bennett, Janine C.; Hollman, David S.; Slattengren, Nicole S.; Kolla, Hemanth K.; Rizzi, Francesco N.; Clay, Robert L.; Teranishi, Keita T.

Abstract not provided.

Hollman, David S.; Wilke, Jeremiah J.; Slattengren, Nicole S.; Kolla, Hemanth K.; Rizzi, Francesco N.; Teranishi, Keita T.; Bennett, Janine C.; Clay, Robert L.

Abstract not provided.

Teranishi, Keita T.; Knight, Samuel K.; Baker, Gavin M.; Gammel, Marc G.; Hollman, David S.; Sjaardema, Gregory D.; Kolla, Hemanth K.; Wilke, Jeremiah J.; Slattengren, Nicole S.; Bennett, Janine C.

Abstract not provided.

Baker, Gavin M.; Bettencourt, Matthew T.; Bova, S.W.; franko, ken f.; Gamell, Marc G.; Grant, Ryan E.; Hammond, Simon D.; Hollman, David S.; Knight, Samuel K.; Kolla, Hemanth K.; Lin, Paul L.; Olivier, Stephen O.; Sjaardema, Gregory D.; Slattengren, Nicole L.; Teranishi, Keita T.; Wilke, Jeremiah J.; Bennett, Janine C.; Clay, Robert L.; kale, laxkimant k.; Jain, Nikhil J.; Mikida, Eric M.; Aiken, Alex A.; Bauer, Michael B.; Lee, Wonchan L.; Slaughter, Elliott S.; Treichler, Sean T.; Berzins, Martin B.; Harman, Todd H.; humphreys, alan h.; schmidt, john s.; sunderland, dan s.; Mccormick, Pat M.; gutierrez, samuel g.; shulz, martin s.; Gamblin, Todd G.; Bremer, Peer-Timo B.

Abstract not provided.

Baker, Gavin M.; Bettencourt, Matthew T.; Bova, S.W.; franko, ken f.; Gamell, Marc G.; Grant, Ryan E.; Hammond, Simon D.; Hollman, David S.; Knight, Samuel K.; Kolla, Hemanth K.; Lin, Paul L.; Olivier, Stephen O.; Sjaardema, Gregory D.; Slattengren, Nicole L.; Teranishi, Keita T.; Wilke, Jeremiah J.; Bennett, Janine C.; Clay, Robert L.; kale, laxkimant k.; Jain, Nikhil J.; Mikida, Eric M.; Aiken, Alex A.; Bauer, Michael B.; Lee, Wonchan L.; Slaughter, Elliott S.; Treichler, Sean T.; Berzins, Martin B.; Harman, Todd H.; humphreys, alan h.; schmidt, john s.; sunderland, dan s.; Mccormick, Pat M.; gutierrez, samuel g.; shulz, martin s.; Gamblin, Todd G.; Bremer, Peer-Timo B.

This report provides in-depth information and analysis to help create a technical road map for developing next-generation programming models and runtime systems that support Advanced Simulation and Computing (ASC) work- load requirements. The focus herein is on asynchronous many-task (AMT) model and runtime systems, which are of great interest in the context of "Oriascale7 computing, as they hold the promise to address key issues associated with future extreme-scale computer architectures. This report includes a thorough qualitative and quantitative examination of three best-of-class AIM] runtime systems – Charm-++, Legion, and Uintah, all of which are in use as part of the Centers. The studies focus on each of the runtimes' programmability, performance, and mutability. Through the experiments and analysis presented, several overarching Predictive Science Academic Alliance Program II (PSAAP-II) Asc findings emerge. From a performance perspective, AIV runtimes show tremendous potential for addressing extreme- scale challenges. Empirical studies show an AM runtime can mitigate performance heterogeneity inherent to the machine itself and that Message Passing Interface (MP1) and AM11runtimes perform comparably under balanced conditions. From a programmability and mutability perspective however, none of the runtimes in this study are currently ready for use in developing production-ready Sandia ASC applications. The report concludes by recommending a co- design path forward, wherein application, programming model, and runtime system developers work together to define requirements and solutions. Such a requirements-driven co-design approach benefits the community as a whole, with widespread community engagement mitigating risk for both application developers developers. and high-performance computing runtime systein

Wilke, Jeremiah J.; Bettencourt, Matthew T.; Bova, S.W.; franko, ken f.; Gamell, Marc G.; Grant, Ryan E.; Hammond, Simon D.; Hollman, David S.; Knight, Samuel K.; Kolla, Hemanth K.; Lin, Paul L.; Olivier, Stephen L.; Sjaardema, Gregory D.; Slattengren, Nicole S.; Teranishi, Keita T.; Bennett, Janine C.; Clay, Robert L.

Abstract not provided.

FTXS 2015 - Proceedings of the 2015 Workshop on Fault Tolerance for HPC at eXtreme Scale, Part of HPDC 2015

Wilke, Jeremiah J.; Kolla, Hemanth K.; Teranishi, Keita T.; Hollman, David S.; Bennett, Janine C.; Slattengren, Nicole S.

In this position paper, we argue for improved fault-tolerance of an MPI code by introducing lightweight virtualization into the MPI interface. In particular, we outline key-value store semantics for MPI send/recv calls, thereby creating a far more expressive programming model. The general message passing semantics and imperative style of MPI application codes would remain essentially unchanged. However, the additional expressiblity of the programming model 1) enables the underlying transport layer to handle faulttolerance more transparently to the application developer, and 2) provides an evolutionary code path towards more declarative asynchronous programming models. The core contribution of this paper is an initial implementation of the DHARMA transport layer that provides the new, required functionality to support the MPI key-value store model.

Bennett, Janine C.; Wilke, Jeremiah J.; Slattengren, Nicole S.; Teranishi, Keita T.; Lin, Paul L.; Sjaardema, Gregory D.; Kolla, Hemanth K.; Hollman, David S.; Knight, Samuel K.; franko, ken f.; Clay, Robert L.

Abstract not provided.

Wilke, Jeremiah J.; Slattengren, Nicole S.; Bennett, Janine C.; Hollman, David S.; Kolla, Hemanth K.; Teranishi, Keita T.

Abstract not provided.

Hollman, David S.; Hollman, David S.; Bennett, Janine C.; Bennett, Janine C.; Wilke, Jeremiah J.; Wilke, Jeremiah J.; Kolla, Hemanth K.; Kolla, Hemanth K.; Lin, Paul L.; Lin, Paul L.; Slattengren, Nicole S.; Slattengren, Nicole S.; Teranishi, Keita T.; Teranishi, Keita T.; franko, ken f.; franko, ken f.; Jain, Nikhil J.; Jain, Nikhil J.; Mikida, Eric M.; Mikida, Eric M.

Abstract not provided.