Suchergebnisse - Communication-avoiding algorithm~

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

Communication-Avoiding Recursive Aggregation von 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 …”
Volltext

Communication avoiding algorithms von Demmel, Jim

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

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

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

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

“… Moreover, the hierarchical nature of the algorithm lends itself readily to emerging architectures …”
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.

“… ) algorithms for challenging multiscale problems. HOLO algorithms attempt to couple one or several high-complexity physical models …”
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

Communication-Avoiding Symmetric-Indefinite Factorization von 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 …”
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

“… 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 …”
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 …”
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 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 …”
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

“… ) 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 …”
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

Translational process: Mathematical software perspective von 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 …”
Volltext

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