Abstract
We pursue the scalable parallel implementation of the factor- ization of band matrices with medium to large bandwidth targeting SMP and multi-core architectures. Our approach decomposes the computation into a large number of fine-grained operations exposing a higher degree of parallelism. The SuperMatrix run-time system allows an out-of-order scheduling of operations that is transparent to the programmer. Exper- imental results for the Cholesky factorization of band matrices on two parallel platforms with sixteen processors demonstrate the scalability of the solution. © 2008 Springer Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Quintana-Ortí, G., Quintana-Ortí, E. S., Remón, A., & Van De Geijn, R. A. (2008). An algorithm-by-blocks for SuperMatrix band cholesky factorization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5336 LNCS, pp. 228–239). https://doi.org/10.1007/978-3-540-92859-1_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
