Algorithms and Abstractions for Assembly in PDE Codes: Workshop Report

Technical Report · 01 December 2014

DOI:https://doi.org/10.2172/1504610· OSTI ID:1504610

Cyr, Eric C. ^[1]; Phipps, Eric Todd ^[1]; Heroux, Michael Allen ^[1]; Hoemmen, Mark Frederick ^[1]; Trott, Christian Robert ^[1]; Brown, Jed ^[2]; Coon, Ethan T. ^[3]; Kirby, Robert C. ^[4]; Kolev, Tzanio V. ^[5]; Sutherland, James C. ^[6]

---

1. Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2. Argonne National Lab. (ANL), Argonne, IL (United States)
3. Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
4. Baylor Univ., Waco, TX (United States)
5. Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
6. Univ. of Utah, Salt Lake City, UT (United States)

The emergence of high-concurrency architectures offering unprecedented performance has brought many high-performance partial differential equation (PDE) discretization codes to the precipice of a major refactor. To help address this challenge a workshop titled "Algorithms and Abstractions for Assembly in PDE Codes" was held in the Computer Science Research Institute at Sandia National Laboratories on May 12th-14th, 2014. This document summarizes the goals of the workshop and the results of the presentations and subsequent discussions.

• Research Organization: Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
• Sponsoring Organization: USDOE National Nuclear Security Administration (NNSA)
• DOE Contract Number: AC04-94AL85000
• OSTI ID: 1504610
• Report Number(s): SAND-2015-1379; 587885
• Country of Publication: United States
• Language: English

Related Subjects

97 MATHEMATICS AND COMPUTING