article

Experiments with multicomputer LU-decomposition

Author:

E. F. van de VeldeAuthors Info & Claims

Concurrency: Practice and Experience, Volume 2, Issue 1

Pages 1 - 26

https://doi.org/10.1002/cpe.4330020102

Published: 01 April 1990 Publication History

Abstract

No abstract available.

Cited By

View all

Lin RYuan XXue WYin WYao JShi JSun QSong CWang FMohror KArnold DBadia R(2023)5 ExaFlop/s HPL-MxP Benchmark with Linear Scalability on the 40-Million-Core Sunway SupercomputerProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis10.1145/3581784.3607030(1-13)Online publication date: 12-Nov-2023
https://dl.acm.org/doi/10.1145/3581784.3607030
Tan GShui CWang YYu XYan Y(2021)Optimizing the LINPACK Algorithm for Large-Scale PCIe-Based CPU-GPU Heterogeneous SystemsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2021.306773132:9(2367-2380)Online publication date: 1-Sep-2021
https://dl.acm.org/doi/10.1109/TPDS.2021.3067731
Chen CFang JTang TYang C(2017)LU factorization on heterogeneous systemsComputing10.1007/s00607-016-0537-299:8(791-811)Online publication date: 1-Aug-2017
https://dl.acm.org/doi/10.1007/s00607-016-0537-2
Show More Cited By

Index Terms

Experiments with multicomputer LU-decomposition

Recommendations

A scalable task parallelism approach for LU decomposition with multicore CPUs
ESPM2: Proceedings of the Second Internationsl Workshop on Extreme Scale Programming Models and Middleware

Many scientific applications have linear systems A · x = b which need to be solved for different vectors b. LU decomposition, which is a variant of Gaussian Elimination, is an efficient technique to solve a linear system. The main idea of the LU ...
LU-Cholesky QR algorithms for thin QR decomposition
Abstract
This paper aims to propose the LU-Cholesky QR algorithms for thin QR decomposition (also called economy size or reduced QR decomposition). CholeskyQR is known as a fast algorithm employed for thin QR decomposition, and CholeskyQR2 aims to improve ...
Domain decomposition based $${\mathcal H}$$-LU preconditioning

Hierarchical matrices provide a data-sparse way to approximate fully populated matrices. The two basic steps in the construction of an $${{\mathcal H}}$$-matrix are (a) the hierarchical construction of a matrix block partition, and (b) the blockwise ...

Comments

Information & Contributors

Information

Published In

cover image Concurrency: Practice and Experience

Concurrency: Practice and Experience Volume 2, Issue 1

Mar. 1990

77 pages

ISSN:1040-3108

Editor:
Geofffrey C. Fox
California Institute of Technology, Pasadena

Issue’s Table of Contents

Publisher

John Wiley and Sons Ltd.

United Kingdom

Publication History

Published: 01 April 1990

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Lin RYuan XXue WYin WYao JShi JSun QSong CWang FMohror KArnold DBadia R(2023)5 ExaFlop/s HPL-MxP Benchmark with Linear Scalability on the 40-Million-Core Sunway SupercomputerProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis10.1145/3581784.3607030(1-13)Online publication date: 12-Nov-2023
https://dl.acm.org/doi/10.1145/3581784.3607030
Tan GShui CWang YYu XYan Y(2021)Optimizing the LINPACK Algorithm for Large-Scale PCIe-Based CPU-GPU Heterogeneous SystemsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2021.306773132:9(2367-2380)Online publication date: 1-Sep-2021
https://dl.acm.org/doi/10.1109/TPDS.2021.3067731
Chen CFang JTang TYang C(2017)LU factorization on heterogeneous systemsComputing10.1007/s00607-016-0537-299:8(791-811)Online publication date: 1-Aug-2017
https://dl.acm.org/doi/10.1007/s00607-016-0537-2
Petitet ADongarra J(1999)Algorithmic Redistribution Methods for Block-Cyclic DecompositionsIEEE Transactions on Parallel and Distributed Systems10.1109/71.81994410:12(1201-1216)Online publication date: 1-Dec-1999
https://dl.acm.org/doi/10.1109/71.819944

Abstract

Cited By

Index Terms

Recommendations

A scalable task parallelism approach for LU decomposition with multicore CPUs

LU-Cholesky QR algorithms for thin QR decomposition

Domain decomposition based $${\mathcal H}$$-LU preconditioning

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations