z-logo
open-access-imgOpen Access
Algorithms and Abstractions for Assembly in PDE Codes: Workshop Report
Author(s) -
Eric C. Cyr,
Eric Phipps,
Michael A. Heroux,
Mark Frederick Hoemmen,
Christian Robert Trott,
Jed Brown,
Ethan T. Coon,
Robert C. Kirby,
Tzanio Kolev,
James C. Sutherland
Publication year - 2014
Language(s) - English
Resource type - Reports
DOI - 10.2172/1504610
Subject(s) - concurrency , code refactoring , computer science , partial differential equation , parallel computing , software engineering , computational science , theoretical computer science , programming language , mathematics , software , mathematical analysis
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 12th14th, 2014. This document summarizes the goals of the workshop and the results of the presentations and subsequent discussions.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom