Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Gonzalo Alvarez 0001

dblp:09/5302 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 67% Emerging computing paradigms · 33%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
High-performance computing
performance optimization at scale
0.112008
New algorithm to enable 400+ TFlop/s sustained performance in simulations of disorder effects in high-Tc superconductors · SC 2008
Emerging computing paradigms › quantum computing › quantum simulation
quantum monte carlo simulation
0.112008
New algorithm to enable 400+ TFlop/s sustained performance in simulations of disorder effects in high-Tc superconductors · SC 2008
High-performance computing
scientific computing systems
0.112008
New algorithm to enable 400+ TFlop/s sustained performance in simulations of disorder effects in high-Tc superconductors · SC 2008
Computational science and engineering
computational physics
0.012008
New algorithm to enable 400+ TFlop/s sustained performance in simulations of disorder effects in high-Tc superconductors · SC 2008

Methods — techniques the papers use, named apart from their topics

mixed single-/double precision · 0.2delayed monte carlo updates · 0.2
YearPublicationVenuePosition
2018 MiniApp for Density Matrix Renormalization Group Hamiltonian Application Kernel
abstract
We present two miniapps that implement the core computational kernel of the DMRG++ application, a generic C++ code that implements the Density Matrix Renormalization Group (DMRG) algorithm. The DMRG++ core Kronecker multiplication kernel is formulated using a batched BLAS approach, with implementation that targets both multi-core CPUs using OpenMP and GPGPU using the MAGMA library. The kernel evaluates the matrix-vector multiplication of the target Hamiltonian matrix used in Lanczos algorithm for computing the lowest eigenvalue and eigenvector. The Hamiltonian matrix is expressed compactly as sums of Kronecker products of small dense matrices. We demonstrate improved performance of the miniapp on synthetic problem, and show the performance of the DMRG++ application using a plugin based on the miniapp. We also present an OpenMP miniapp that explores the use of nested parallel constructs to implement the Kronecker multiplication kernel, exploring the use of nested OpenMP worksharing and tasking abstractions to implement the multi-level parallel multiplication algorithm. The miniapp has been used as a co-design vehicle for evaluating features in the OpenMP-4.5 and upcoming OpenMP-5.0 standards.
Wael R. Elwasif, Eduardo F. D'Azevedo, Arghya Chatterjee 0001, Gonzalo Alvarez 0001, Oscar R. Hernandez, Vivek Sarkar
CLUSTER4
2009 Accuracy and performance of graphics processors: A Quantum Monte Carlo application case study
Jeremy S. Meredith, Gonzalo Alvarez 0001, Thomas A. Maier, Thomas C. Schulthess, Jeffrey S. Vetter
Parallel Comput.2
2008 New algorithm to enable 400+ TFlop/s sustained performance in simulations of disorder effects in high-Tc superconductors
abstract
Staggering computational and algorithmic advances in recent years now make possible systematic Quantum Monte Carlo (QMC) simulations of high temperature (high-Tc) superconductivity in a microscopic model, the two dimensional (2D) Hubbard model, with parameters relevant to the cuprate materials. Here we report the algorithmic and computational advances that enable us to study the effect of disorder and nano-scale inhomogeneities on the pair-formation and the superconducting transition temperature necessary to understand real materials. The simulation code is written with a generic and extensible approach and is tuned to perform well at scale. Significant algorithmic improvements have been made to make effective use of current supercomputing architectures. By implementing delayed Monte Carlo updates and a mixed single-/double precision mode, we are able to dramatically increase the efficiency of the code. On the Cray XT4 systems of the Oak Ridge National Laboratory (ORNL), for example, we currently run production jobs on 31 thousand processors and thereby routinely achieve a sustained performance that exceeds 200 TFlop/s. On a system with 49 thousand processors we achieved a sustained performance of 409 TFlop/s. We present a study of how random disorder in the effective Coulomb interaction strength affects the superconducting transition temperature in the Hubbard model.
Gonzalo Alvarez 0001, Michael S. Summers, Don E. Maxwell, Markus Eisenbach 0002, Jeremy S. Meredith, Jeffrey M. Larkin, John M. Levesque, Thomas A. Maier, Paul R. C. Kent, Eduardo F. D'Azevedo, Thomas C. Schulthess
SC1