default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark Hoemmen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c16]Ichitaro Yamazaki, Stephen J. Thomas, Mark Hoemmen, Erik G. Boman, Katarzyna Swirydowicz, James J. Elliott:
Low-synchronization orthogonalization schemes for s-step and pipelined Krylov solvers in Trilinos. PP 2020: 118-128- [i8]David S. Hollman, Bryce Adelstein-Lelbach, H. Carter Edwards, Mark Hoemmen, Daniel Sunderland, Christian R. Trott:
mdspan in C++: A Case Study in the Integration of Performance Portable Features into International Language Standards. CoRR abs/2010.06474 (2020)
2010 – 2019
- 2019
- [c15]David S. Hollman, Bryce Lelbach, H. Carter Edwards, Mark Hoemmen, Daniel Sunderland, Christian R. Trott:
mdspan in C++: A Case Study in the Integration of Performance Portable Features into International Language Standards. P3HPC@SC 2019: 60-70 - 2017
- [j8]Andrew A. Chien, Pavan Balaji, Nan Dun, Aiman Fang, Hajime Fujita, Kamil Iskra
, Zachary A. Rubenstein, Ziming Zheng, Jeff R. Hammond, Ignacio Laguna, D. Richards, Anshu Dubey, Brian van Straalen, Mark Hoemmen, Michael A. Heroux, Keita Teranishi, Andrew R. Siegel:
Exploring versioned distributed arrays for resilience in scientific applications. Int. J. High Perform. Comput. Appl. 31(6): 564-590 (2017) - [j7]Eric T. Phipps, Marta D'Elia, H. Carter Edwards, Mark Hoemmen, Jonathan J. Hu, Sivasankaran Rajamanickam:
Embedded Ensemble Propagation for Improving Performance, Portability, and Scalability of Uncertainty Quantification on Emerging Computational Architectures. SIAM J. Sci. Comput. 39(2) (2017) - [c14]Ichitaro Yamazaki, Mark Hoemmen, Piotr Luszczek, Jack J. Dongarra:
Improving Performance of GMRES by Reducing Communication and Pipelining Global Collectives. IPDPS Workshops 2017: 1118-1127 - 2016
- [j6]James Elliott, Mark Hoemmen, Frank Mueller:
Exploiting data representation for fault tolerance. J. Comput. Sci. 14: 51-60 (2016) - [c13]Ryan Eberhardt, Mark Hoemmen:
Optimization of Block Sparse Matrix-Vector Multiplication on Shared-Memory Parallel Architectures. IPDPS Workshops 2016: 663-672 - 2015
- [c12]James Elliott, Mark Hoemmen, Frank Mueller:
A Numerical Soft Fault Model for Iterative Linear Solvers. HPDC 2015: 271-274 - [c11]Andrew A. Chien, Pavan Balaji, Peter H. Beckman, Nan Dun, Aiman Fang, Hajime Fujita, Kamil Iskra, Zachary A. Rubenstein, Ziming Zheng, Rob Schreiber, Jeff R. Hammond, James Dinan, Ignacio Laguna, D. Richards, Anshu Dubey, Brian van Straalen, Mark Hoemmen, Michael A. Heroux, Keita Teranishi, Andrew R. Siegel:
Versioned Distributed Arrays for Resilience in Scientific Applications: Global View Resilience. ICCS 2015: 29-38 - [c10]Erik P. DeBenedictis, Jeanine E. Cook, Mark Hoemmen, Tzevetan S. Metodi:
Optimal adiabatic scaling and the processor-in-memory-and-storage architecture (OAS+PIMS). NANOARCH 2015: 69-74 - [i7]Eric T. Phipps, Marta D'Elia, H. Carter Edwards, Mark Hoemmen, Jonathan J. Hu, Sivasankaran Rajamanickam:
Embedded Ensemble Propagation for Improving Performance, Portability and Scalability of Uncertainty Quantification on Emerging Computational Architectures. CoRR abs/1511.03703 (2015) - 2014
- [j5]Grey Ballard, Erin C. Carson, James Demmel, Mark Hoemmen, Nicholas Knight, Oded Schwartz:
Communication lower bounds and optimal algorithms for numerical linear algebra. Acta Numer. 23: 1-155 (2014) - [j4]Paul T. Lin, Matthew T. Bettencourt, Stefan Domino, Travis Fisher, Mark Hoemmen, Jonathan J. Hu, Eric T. Phipps, Andrey Prokopenko, Sivasankaran Rajamanickam, Christopher M. Siefert, Stephen Kennon:
Towards Extreme-Scale Simulations for Low Mach Fluids with Second-Generation Trilinos. Parallel Process. Lett. 24(4) (2014) - [c9]Ichitaro Yamazaki, Hartwig Anzt, Stanimire Tomov, Mark Hoemmen, Jack J. Dongarra:
Improving the Performance of CA-GMRES on Multicores with Multiple GPUs. IPDPS 2014: 382-391 - [c8]James Elliott, Mark Hoemmen, Frank Mueller:
Evaluating the Impact of SDC on the GMRES Iterative Solver. IPDPS 2014: 1193-1202 - [c7]Paul T. Lin, Matthew T. Bettencourt, Stefan Domino, Travis Fisher, Mark Hoemmen, Jonathan J. Hu, Eric T. Phipps, Andrey Prokopenko, Sivasankaran Rajamanickam, Christopher M. Siefert, Eric C. Cyr, Stephen Kennon:
Towards Extreme-Scale Simulations with Next-Generation Trilinos: A Low Mach Fluid Application Case Study. IPDPS Workshops 2014: 1485-1494 - [c6]James Elliott, Mark Hoemmen, Frank Mueller:
Exploiting data representation for fault tolerance. ScalA@SC 2014: 9-16 - [c5]Ichitaro Yamazaki, Sivasankaran Rajamanickam, Erik G. Boman, Mark Hoemmen, Michael A. Heroux, Stanimire Tomov:
Domain Decomposition Preconditioners for Communication-Avoiding Krylov Methods on a Hybrid CPU/GPU Cluster. SC 2014: 933-944 - [i6]James Elliott, Mark Hoemmen, Frank Mueller:
Resilience in Numerical Methods: A Position on Fault Models and Methodologies. CoRR abs/1401.3013 (2014) - [i5]James Elliott, Mark Hoemmen, Frank Mueller:
Tolerating Silent Data Corruption in Opaque Preconditioners. CoRR abs/1404.5552 (2014) - 2013
- [i4]James Elliott, Mark Hoemmen, Frank Mueller:
Evaluating the Impact of SDC on the GMRES Iterative Solver. CoRR abs/1311.6505 (2013) - [i3]James Elliott, Mark Hoemmen, Frank Mueller:
Exploiting Data Representation for Fault Tolerance. CoRR abs/1312.2333 (2013) - 2012
- [j3]James Demmel, Laura Grigori, Mark Hoemmen, Julien Langou:
Communication-optimal Parallel and Sequential QR and LU Factorizations. SIAM J. Sci. Comput. 34(1) (2012) - [j2]Eric Bavier, Mark Hoemmen, Sivasankaran Rajamanickam, Heidi Thornquist:
Amesos2 and Belos: Direct and iterative solvers for large sparse linear systems. Sci. Program. 20(3): 241-255 (2012) - [i2]Patrick G. Bridges, Kurt B. Ferreira, Michael A. Heroux, Mark Hoemmen:
Fault-tolerant linear solvers via selective reliability. CoRR abs/1206.1390 (2012) - 2011
- [c4]Patrick G. Bridges, Mark Hoemmen, Kurt B. Ferreira, Michael A. Heroux, Philip Soltero, Ron Brightwell:
Cooperative Application/OS DRAM Fault Recovery. Euro-Par Workshops (2) 2011: 241-250 - [c3]Mark Hoemmen:
A Communication-Avoiding, Hybrid-Parallel, Rank-Revealing Orthogonalization Method. IPDPS 2011: 966-977 - 2010
- [b1]Mark Hoemmen:
Communication-avoiding Krylov subspace methods. University of California, Berkeley, USA, 2010
2000 – 2009
- 2009
- [j1]James Demmel, Mark Hoemmen, Yozo Hida, E. Jason Riedy:
Nonnegative Diagonals and High Performance on Low-Profile Matrices from Householder QR. SIAM J. Sci. Comput. 31(4): 2832-2841 (2009) - [c2]Marghoob Mohiyuddin, Mark Hoemmen, James Demmel, Katherine A. Yelick:
Minimizing communication in sparse matrix solvers. SC 2009 - 2008
- [c1]James Demmel, Mark Hoemmen, Marghoob Mohiyuddin, Katherine A. Yelick:
Avoiding communication in sparse matrix computations. IPDPS 2008: 1-12 - [i1]James Demmel, Laura Grigori, Mark Hoemmen, Julien Langou:
Communication-avoiding parallel and sequential QR factorizations. CoRR abs/0806.2159 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
