Hierarchical QR factorization algorithms for multi-core cluster systems
University of Tennessee Knoxville, USA
arXiv:1110.1553v1 [cs.DC] (7 Oct 2011)
@article{2011arXiv1110.1553D,
author={Dongarra}, J. and {Faverge}, M. and {Herault}, T. and {Langou}, J. and {Robert}, Y.},
title={"{Hierarchical QR factorization algorithms for multi-core cluster systems}"},
journal={ArXiv e-prints},
archivePrefix={"arXiv"},
eprint={1110.1553},
primaryClass={"cs.DC"},
keywords={Computer Science – Distributed, Parallel, and Cluster Computing},
year={2011},
month={oct},
adsurl={http://adsabs.harvard.edu/abs/2011arXiv1110.1553D},
adsnote={Provided by the SAO/NASA Astrophysics Data System}
}
This paper describes a new QR factorization algorithm which is especially designed for massively parallel platforms combining parallel distributed multi-core nodes. These platforms make the present and the foreseeable future of high-performance computing. Our new QR factorization algorithm falls in the category of the tile algorithms which naturally enables good data locality for the sequential kernels executed by the cores (high sequential performance), low number of messages in a parallel distributed setting (small latency term), and fine granularity (high parallelism).
November 20, 2011 by hgpu
