Suchergebnisse - "Communication-avoiding algorithm"

Parallel Communication-Avoiding Algorithm for Triangular Matrix Inversion on Homogeneous and Heterogeneous Platforms von Mahfoudhi, Ryma, Mahjoub, Zaher, Nasri, Wahid

“… We address in this paper the parallelization of a recursive algorithm for large scale triangular matrix inversion based on the ‘Divide and Conquer’ (D&C) …”
Volltext

An efficient randomized QLP algorithm for approximating the singular value decomposition von 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 …”
Volltext

Parallel Tall-and-Skinny QR Factorization Based on LU-CholeskyQR Algorithm von 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 …”
Volltext

EA4RCA:Efficient AIE accelerator design framework for Regular Communication-Avoiding Algorithm von Zhang, W B, Liu, Y Q, Zang, T H, Bao, Z S

“… With the introduction of the Adaptive Intelligence Engine (AIE), the Versal Adaptive Compute Acceleration Platform (Versal ACAP) has garnered great attention …”
Volltext

A communication-avoiding implicit–explicit method for a free-surface ocean model von 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 …”
Volltext

CholeskyQR2: a simple and communication-avoiding algorithm for computing a tall-skinny QR factorization on a large-scale parallel system von Fukaya, Takeshi, Nakatsukasa, Yuji, Yanagisawa, Yuka, Yamamoto, Yusaku

“… Designing communication-avoiding algorithms is crucial for high performance computing on a large-scale parallel system …”
Volltext

Unified Communication Optimization Strategies for Sparse Triangular Solver on CPU and GPU Clusters von 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 …”
Volltext

Efficient parallel CP decomposition with pairwise perturbation and multi-sweep dimension tree von 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 …”
Volltext

Communication-Avoiding Cholesky-QR2 for Rectangular Matrices von 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 …”
Volltext

A Communication-Avoiding 3D LU Factorization Algorithm for Sparse Matrices von 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 …”
Volltext

A Sparse Direct Solver for Distributed Memory Xeon Phi-Accelerated Systems von 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 …”
Volltext

Communication Avoiding Algorithms: Analysis and Code Generation for Parallel Systems von Murthy, Karthik, Mellor-Crummey, John

“… The class of .5D communication-avoiding algorithms were developed to address this bottleneck …”
Volltext

A massively parallel tensor contraction framework for coupled-cluster computations von 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 …”
Volltext

A Class of Communication-avoiding Algorithms for Solving General Dense Linear Systems on CPU/GPU Parallel Machines von Baboulin, Marc, Donfack, Simplice, Dongarra, Jack, Grigori, Laura, Rémy, Adrien, Tomov, Stanimire

“… We study several solvers for the solution of general linear systems where the main objective is to reduce the communication overhead due to pivoting. We first …”
Volltext

Communication-Avoiding Algorithms for a High-Performance Hyperbolic Pde Engine von Charrier, Dominic Etienne

“… The study of waves has always been an important subject of research. Earthquakes, for example, have a direct impact on the daily lives of millions of people …”
Volltext

Multiscale high-order/low-order (HOLO) algorithms and applications von 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 …”
Volltext

Communication Avoiding Block Low-Rank Parallel Multifrontal Triangular Solve with Many Right-Hand Sides von 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 …”
Volltext

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

“… In the past decade there has been a growing interest in communication-avoiding algorithms. The distributed memory Fast Fourier Transform is an important algorithm which suffers from major communication bottlenecks …”
Volltext

Communication avoiding algorithms von Demmel, Jim

“… This article consists of a collection of slides from the author's conference presentation. Some of the specific areas/topics discussed include: To redesign …”
Volltext

Multiscale high-order/low-order (HOLO) algorithms and applications von 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 …”
Volltext