Gaussian predictive process models for large spatial data sets

S Banerjee, AE Gelfand, AO Finley… - Journal of the Royal …, 2008 - academic.oup.com
With scientific data available at geocoded locations, investigators are increasingly turning to
spatial process models for carrying out statistical inference. Over the last decade …

Fault tolerant preconditioned conjugate gradient for sparse linear system solution

M Shantharam, S Srinivasmurthy… - Proceedings of the 26th …, 2012 - dl.acm.org
In scientific applications that involve dense matrices, checksum encodings have yielded"
algorithm-based fault tolerance"(ABFT) in the event of data corruption from either hard or …

Characterizing the impact of soft errors on iterative methods in scientific computing

M Shantharam, S Srinivasmurthy… - Proceedings of the …, 2011 - dl.acm.org
The increase in on-chip transistor count facilitates achieving higher performance, but at the
expense of higher susceptibility to soft errors. In this paper, we characterize the challenges …

Nitro: A framework for adaptive code variant tuning

S Muralidharan, M Shantharam, M Hall… - 2014 IEEE 28th …, 2014 - ieeexplore.ieee.org
Autotuning systems intelligently navigate a search space of possible implementations of a
computation to find the implementation (s) that best meets a specific optimization criteria …

[KNJIGA][B] Algorithm Engineering

M Müller-Hannemann, S Schirra - 2001 - Springer
The systematic development of efficient algorithms has become a key technology for all
kinds of ambitious and innovative computer applications. With major parts of algorithmic …

[KNJIGA][B] Introduction to parallel computing

ZJ Czech - 2016 - books.google.com
The constantly increasing demand for more computing power can seem impossible to keep
up with. However, multicore processors capable of performing computations in parallel allow …

Architecture-adaptive code variant tuning

S Muralidharan, A Roy, M Hall, M Garland… - ACM SIGARCH …, 2016 - dl.acm.org
Code variants represent alternative implementations of a computation, and are common in
high-performance libraries and applications to facilitate selecting the most appropriate …

Parallel hierarchical hybrid linear solvers for emerging computing platforms

E Agullo, L Giraud… - Comptes …, 2011 - comptes-rendus.academie-sciences …
La conception des plateformes d'échelle extrême qui devraient être disponibles dans la
décade à venir représenteront la convergence de tendances technologiques et définiront le …

Parallel dichotomy algorithm for solving tridiagonal system of linear equations with multiple right-hand sides

AV Terekhov - Parallel Computing, 2010 - Elsevier
A parallel algorithm for solving a series of matrix equations with a constant tridiagonal matrix
and different right-hand sides is proposed and studied. The process of solving the problem …

Heterogeneous sparse matrix–vector multiplication via compressed sparse row format

PA Lane, JD Booth - Parallel Computing, 2023 - Elsevier
Sparse matrix–vector multiplication (SpMV) is one of the most important kernels in high-
performance computing (HPC), yet SpMV normally suffers from ill performance on many …