3 citations · 3 across the 5 of their papers we have counts for
5 papers
Characterizing the Performance of Node-Aware Strategies for Irregular Point-to-Point Communication on Heterogeneous Architectures
Shelby Lockhart, Amanda Bienz, William D. Gropp +1
Supercomputer architectures are trending toward higher computational throughput due to the inclusion of heterogeneous compute nodes. These multi-GPU nodes increase on-node computat…
Performance Analysis and Optimal Node-Aware Communication for Enlarged Conjugate Gradient Methods
Shelby Lockhart, Amanda Bienz, William Gropp +1
Krylov methods are a key way of solving large sparse linear systems of equations, but suffer from poor strong scalabilty on distributed memory machines. This is due to high synchro…
Performance of Low Synchronization Orthogonalization Methods in Anderson Accelerated Fixed Point Solvers
Shelby Lockhart, David J. Gardner, Carol S. Woodward +2
Anderson Acceleration (AA) is a method to accelerate the convergence of fixed point iterations for nonlinear, algebraic systems of equations. Due to the requirement of solving a le…
Modeling Data Movement Performance on Heterogeneous Architectures
Amanda Bienz, Luke N. Olson, William D. Gropp +1
The cost of data movement on parallel systems varies greatly with machine architecture, job partition, and nearby jobs. Performance models that accurately capture the cost of data…
Trust-Region Methods for Sparse Relaxation
Lasith Adhikari, Jennifer B. Erway, Shelby Lockhart +1
In this paper, we solve the l2-l1 sparse recovery problem by transforming the objective function of this problem into an unconstrained differentiable function and apply a limited-m…