Search Results - Communication-avoiding algorithm*

A communication-avoiding 3D algorithm for sparse LU factorization on heterogeneous systems by Sao, Piyush, Li, Xiaoye S., Vuduc, Richard

“…We propose a new algorithm to improve the strong scalability of right-looking sparse LU factorization on distributed memory systems…”
Get full text

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

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

Communication avoiding algorithms by Demmel, Jim

“… Some of the specific areas/topics discussed include: To redesign algorithms to avoid communication between all memory hierarchy levels…”
Get full text

A communication-avoiding 3D algorithm for sparse LU factorization on heterogeneous systems by 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…”
Get full text

An efficient randomized QLP algorithm for approximating the singular value decomposition by 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…”
Get full text

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

“… Afterwards, we develop in the second part of the paper, an optimal parallel avoiding-communication algorithm for a given number of available homogeneous and heterogeneous processors…”
Get full text

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

“…) algorithms for challenging multiscale problems. HOLO algorithms attempt to couple one or several high-complexity physical models…”
Get full text

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

A massively parallel tensor contraction framework for coupled-cluster computations by 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…”
Get full text

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

“… Then we introduce a solver where the panel factorization is performed using a communication-avoiding pivoting heuristic while the update of the trailing submatrix is performed by the GPU…”
Get full text

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

“…We present optimal parallel QR factorization algorithms with reduced communication overhead…”
Get full text

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

“… Implementing recursive aggregation has posed a serious algorithmic challenge, with state-of-the-art work identifying sufficient conditions (e.g., pre-mappability…”
Get full text

Communication-Avoiding Algorithms for a High-Performance Hyperbolic Pde Engine by 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…”
Get full text

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

“… The method is second-order accurate and scales algorithmically, with allowed timesteps much larger than fully explicit methods…”
Get full text

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

“…) algorithms for challenging multiscale problems. HOLO algorithms attempt to couple one or several high-complexity physical models…”
Get full text

Parallel Fast Multipole Method accelerated FFT on HPC clusters by 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…”
Get full text

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

“…$ is lower triangular, and $T$ is block tridiagonal and banded. The algorithm is the first symmetric-indefinite communication-avoiding factorization…”
Get full text

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

“…) algorithm is considered a typical application within the AIE architecture. Nevertheless, the effective utilization of AIE in CA applications remains an area that requires further exploration…”
Get full text

Accelerating solutions of one-dimensional unsteady PDEs with GPU-based swept time–space decomposition by 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…”
Get full text

Translational process: Mathematical software perspective by 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 and analysis of new algorithms…”
Get full text