Výsledky vyhľadávania - "communication avoiding algorithm"

An efficient randomized QLP algorithm for approximating the singular value decomposition Autor Kaloorazi, M.F., Liu, K., Chen, J., de Lamare, R.C.

“…The rank-revealing pivoted QLP decomposition approximates the computationally prohibitive singular value decomposition (SVD) via two consecutive column-pivoted…”
Získať plný text

Parallel Tall-and-Skinny QR Factorization Based on LU-CholeskyQR Algorithm Autor Uchino, Yuki, Imamura, Toshiyuki

“…We present optimal parallel QR factorization algorithms with reduced communication overhead. QR factorization is widely applied to solve various problems in…”
Získať plný text

A communication-avoiding implicit–explicit method for a free-surface ocean model Autor Newman, Christopher, Womeldorff, Geoffrey, Knoll, Dana A., Chacón, Luis

“…We examine a nonlinear elimination method for the free-surface ocean equations based on barotropic–baroclinic decomposition. The two dimensional scalar…”
Získať plný text

Unified Communication Optimization Strategies for Sparse Triangular Solver on CPU and GPU Clusters Autor Liu, Yang, Ding, Nan, Sao, Piyush, Williams, Samuel, Li, Xiaoye Sherry

“…This paper presents a unified communication optimization frame-work for sparse triangular solve (SpTRSV) algorithms on CPU and GPU clusters. The framework…”
Získať plný text

Efficient parallel CP decomposition with pairwise perturbation and multi-sweep dimension tree Autor Ma, Linjian, Solomonik, Edgar

“…The widely used alternating least squares (ALS) algorithm for the canonical polyadic (CP) tensor decomposition is dominated in cost by the matricized-tensor…”
Získať plný text

Communication-Avoiding Cholesky-QR2 for Rectangular Matrices Autor Hutter, Edward, Solomonik, Edgar

“…Scalable QR factorization algorithms for solving least squares and eigenvalue problems are critical given the increasing parallelism within modern machines. We…”
Získať plný text

A Communication-Avoiding 3D LU Factorization Algorithm for Sparse Matrices Autor Sao, Piyush, Li, Xiaoye Sherry, Vuduc, Richard

“…We propose a new algorithm to improve the strong scalability of right-looking sparse LU factorization on distributed memory systems. Our 3D sparse LU algorithm…”
Získať plný text

A Sparse Direct Solver for Distributed Memory Xeon Phi-Accelerated Systems Autor Sao, Piyush, Xing Liu, Vuduc, Richard, Xiaoye Li

“…This paper presents the first sparse direct solver for distributed memory systems comprising hybrid multicourse CPU and Intel Xeon Pico-processors. It builds…”
Získať plný text

A massively parallel tensor contraction framework for coupled-cluster computations Autor Solomonik, Edgar, Matthews, Devin, Hammond, Jeff R., Stanton, John F., Demmel, James

“…Precise calculation of molecular electronic wavefunctions by methods such as coupled-cluster requires the computation of tensor contractions, the cost of which…”
Získať plný text

Multiscale high-order/low-order (HOLO) algorithms and applications Autor Chacón, L., Chen, G., Knoll, D.A., Newman, C., Park, H., Taitano, W., Willert, J.A., Womeldorff, G.

“…We review the state of the art in the formulation, implementation, and performance of so-called high-order/low-order (HOLO) algorithms for challenging…”
Získať plný text

Communication Avoiding Block Low-Rank Parallel Multifrontal Triangular Solve with Many Right-Hand Sides Autor Amestoy, Patrick, Boiteau, Olivier, Buttari, Alfredo, Gerest, Matthieu, Jézéquel, Fabienne, L’Excellent, Jean-Yves, Mary, Theo

“…Block low-rank (BLR) compression can significantly reduce the memory and time costs of parallel sparse direct solvers. In this paper, we investigate the…”
Získať plný text

Parallel Fast Multipole Method accelerated FFT on HPC clusters Autor Mehta, Chahak, Karthi, Amarnath, Jetly, Vishrut, Chaudhury, Bhaskar

“…With increasing sizes of distributed systems, there comes an increased risk of communication bottlenecks. In the past decade there has been a growing interest…”
Získať plný text

Multiscale high-order/low-order (HOLO) algorithms and applications Autor Chacon, Luis, Chen, Guangye, Knoll, Dana Alan, Newman, Christopher Kyle, Park, HyeongKae, Taitano, William, Willert, Jeff A., Womeldorff, Geoffrey Alan

“…Here, we review the state of the art in the formulation, implementation, and performance of so-called high-order/low-order (HOLO) algorithms for challenging…”
Získať plný text

Communication-Avoiding Recursive Aggregation Autor Sun, Yihao, Kumar, Sidharth, Gilray, Thomas, Micinski, Kristopher

“…Recursive aggregation has been of considerable interest due to its unifying a wide range of deductive-analytic workloads, including social-media mining and…”
Získať plný text

Translational process: Mathematical software perspective Autor Dongarra, Jack, Gates, Mark, Luszczek, Piotr, Tomov, Stanimire

“…Each successive generation of computer architecture has brought new challenges to achieving high performance mathematical solvers, necessitating development…”
Získať plný text

Accelerating solutions of one-dimensional unsteady PDEs with GPU-based swept time–space decomposition Autor Magee, Daniel J., Niemeyer, Kyle E.

“…•A GPU implementation of the swept time–space decomposition rule is presented.•Three versions of the scheme are considered.•The shared-memory implementation…”
Získať plný text

Reconstructing Householder vectors from Tall-Skinny QR Autor Ballard, G., Demmel, J., Grigori, L., Jacquelin, M., Knight, N., Nguyen, H.D.

“…The Tall-Skinny QR (TSQR) algorithm is more communication efficient than the standard Householder algorithm for QR decomposition of matrices with many more…”
Získať plný text

Applying the swept rule for solving explicit partial differential equations on heterogeneous computing systems Autor Magee, Daniel J., Walker, Anthony S., Niemeyer, Kyle E.

“…Applications that exploit the architectural details of high-performance computing (HPC) systems have become increasingly invaluable in academia and industry…”
Získať plný text

Reducing Communication in Graph Neural Network Training Autor Tripathy, Alok, Yelick, Katherine, Buluc, Aydin

“…Graph Neural Networks (GNNs) are powerful and flexible neural networks that use the naturally sparse connectivity information of the data. GNNs represent this…”
Získať plný text

Communication-Avoiding Symmetric-Indefinite Factorization Autor Ballard, Grey, Becker, Dulceneia, Demmel, James, Dongarra, Jack, Druinsky, Alex, Peled, Inon, Schwartz, Oded, Toledo, Sivan, Yamazaki, Ichitaro

“…We describe and analyze a novel symmetric triangular factorization algorithm. The algorithm is essentially a block version of Aasen's triangular…”
Získať plný text