An Algorithm-by-Blocks for SuperMatrix Band Cholesky Factorization

  • Authors:
  • Gregorio Quintana-Ortí;Enrique S. Quintana-Ortí;Alfredo Remón;Robert A. Geijn

  • Affiliations:
  • Departamento de Ingeniería y Ciencia de Computadores, Universidad Jaume I, Spain;Departamento de Ingeniería y Ciencia de Computadores, Universidad Jaume I, Spain;Departamento de Ingeniería y Ciencia de Computadores, Universidad Jaume I, Spain;Department of Computer Sciences, The University of Texas at Austin, Austin 78712

  • Venue:
  • High Performance Computing for Computational Science - VECPAR 2008
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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.