Zobrazeno 1 - 10
of 21
pro vyhledávání: '"David S. Hollman"'
Tensor decomposition models play an increasingly important role in modern data science applications. One problem of particular interest is fitting a low-rank Canonical Polyadic (CP) tensor decomposition model when the tensor has sparse structure and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::043b16ca48f739ee391a346c5a358159
https://doi.org/10.2172/1706215
https://doi.org/10.2172/1706215
Publikováno v:
P3HPC@SC
Great strides have been made to enable performance, portability, and productivity in HPC, but the focus has so far been on standalone applications and on-node programming models. Complex workflows comprising many communicating orchestrators, services
Publikováno v:
HPEC
Tensor decomposition models play an increasingly important role in modern data science applications. One problem of particular interest is fitting a low-rank Canonical Polyadic (CP) tensor decomposition model when the tensor has sparse structure and
Publikováno v:
Molecular Physics. 115:2065-2076
An algorithm is presented for computing the Hartree–Fock exchange matrix using concentric atomic density fitting with data and instruction count complexities. The algorithm exploits the asymptotic ...
Autor:
Mark Hoemmen, Christian Robert Trott, H. Carter Edwards, Bryce Adelstein Lelbach, David S. Hollman, Daniel Sunderland
Publikováno v:
2019 IEEE/ACM International Workshop on Performance, Portability and Productivity in HPC (P3HPC).
Multi-dimensional arrays are ubiquitous in high-performance computing (HPC), but their absence from the C++ language standard is a long-standing and well-known limitation of their use for HPC. This paper describes the design and implementation of mds
Autor:
Noah Evans, Bronis R. de Supinski, David S. Hollman, Thomas R. W. Scogland, Stephen L. Olivier, Dan Sunderland
Publikováno v:
OpenMP: Conquering the Full Hardware Spectrum ISBN: 9783030285951
IWOMP
IWOMP
For at least the last 20 years, many have tried to create a general resource management system to support interoperability across various concurrent libraries. The previous strategies all suffered from additional toolchain requirements, and/or a usag
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::da44f4fed388bc94cd377828820a55b3
https://doi.org/10.1007/978-3-030-28596-8_22
https://doi.org/10.1007/978-3-030-28596-8_22
Publikováno v:
ESPM2@SC
Futures are a widely-used abstraction for enabling deferred execution in imperative programs. Deferred execution enqueues tasks rather than explicitly blocking and waiting for them to execute. Many task-based programming models with some form of defe
Autor:
Nicole Lemaster Slattengren, J. Perez, Stan Gerald Moore, Janine C. Bennett, David S. Hollman, Eric T. Phipps, Aram Markosyan, Robert L. Clay, Harold C. Edwards, Jonathan Lifflander, Hemanth Kolla, Jeremiah J. Wilke, Stephen L. Olivier, Micheal W. Glass, Francesco Rizzi, Daniel Sunderland, Matthew Tyler Bettencourt, David John Littlewood
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e1b87400be40e3d5f12223f0c87b329
https://doi.org/10.2172/1596197
https://doi.org/10.2172/1596197
Autor:
David S. Hollman, Janine C. Bennett, Hemanth Kolla, Jonathan Lifflander, Nicole Slattengren, Jeremiah Wilke
Publikováno v:
2016 Second International Workshop on Extreme Scale Programming Models and Middlewar (ESPM2).
Autor:
Janine C. Bennett, Jeremiah J. Wilke, Hemanth Kolla, Keita Teranishi, Nicole Lemaster Slattengren, Francesco Rizzi, David S. Hollman, Jonathan Lifflander
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::57ea016a6f085568577e2d24306d8acc
https://doi.org/10.2172/1476893
https://doi.org/10.2172/1476893