arXiv Open Access 2018

A 3D Parallel Algorithm for QR Decomposition

Grey Ballard James Demmel Laura Grigori Mathias Jacquelin Nicholas Knight

Lihat Sumber

Abstrak

Interprocessor communication often dominates the runtime of large matrix computations. We present a parallel algorithm for computing QR decompositions whose bandwidth cost (communication volume) can be decreased at the cost of increasing its latency cost (number of messages). By varying a parameter to navigate the bandwidth/latency tradeoff, we can tune this algorithm for machines with different communication costs.

Topik & Kata Kunci

cs.DC

Penulis (5)

Grey Ballard

James Demmel

Laura Grigori

Mathias Jacquelin

Nicholas Knight

Format Sitasi

APA MLA BibTeX

Ballard, G., Demmel, J., Grigori, L., Jacquelin, M., Knight, N. (2018). A 3D Parallel Algorithm for QR Decomposition. https://arxiv.org/abs/1805.05278

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2018
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓