Výsledky vyhľadávania - Communication-avoiding algorithms*

Communication avoiding algorithms Autor 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…”
Získať plný text

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

“… The class of .5D communication-avoiding algorithms were developed to address this bottleneck…”
Získať plný text

A Class of Communication-avoiding Algorithms for Solving General Dense Linear Systems on CPU/GPU Parallel Machines Autor 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…”
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

A communication-avoiding 3D algorithm for sparse LU factorization on heterogeneous systems Autor 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. Our 3D algorithm for…”
Získať plný text

Communication-Avoiding Algorithms for a High-Performance Hyperbolic Pde Engine Autor 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…”
Získať plný text

Parallel Communication-Avoiding Algorithm for Triangular Matrix Inversion on Homogeneous and Heterogeneous Platforms Autor 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…”
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

Rethinking algorithms for future architectures: Communication-avoiding algorithms Autor Demmel, Jim

“…This article consists of a collection of slides from the author's conference presentation on the deployment of communication-avoiding algorithms…”
Získať plný text

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 Fast Multipole Method accelerated FFT on HPC clusters Autor 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…”
Získať plný text

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

“…—accumulate in a large simulation and become a significant barrier to performance. The swept time-space decomposition rule is a communication-avoiding technique for time-stepping stencil update formulas that attempts…”
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