Leveraging task-parallelism in message-passing dense matrix factorizations using SMPSs

  • Martín Huertas, Alberto Francisco
  • Reyes, Ruyman
  • Badia Sala, Rosa Maria
  • Quintana Ortí, Enrique Salvador

Abstract

In this paper, we investigate how to exploit task-parallelism during the execution of the Cholesky factorization on clusters of multicore processors with the SMPSs programming model. Our analysis reveals that the major difficulties in adapting the code for this operation in ScaLAPACK to SMPSs lie in algorithmic restrictions and the semantics of the SMPSs programming model, but also that they both can be overcome with a limited programming effort. The experimental results report considerable gains in performance and scalability of the routine parallelized with SMPSs when compared with conventional approaches to execute the original ScaLAPACK implementation in parallel as well as two recent message-passing routines for this operation. In summ...

Extracted data

Loading...

Related items

Leveraging task-parallelism in message-passing dense matrix factorizations using SMPSs
  • Martín, Alberto F.
  • Reyes, Ruyman
  • Badia, Rosa M.
  • Quintana-Orti, Enrique S.
April 2016

In this paper, we investigate how to exploit task-parallelism during the execution of the Cholesky f...

Task-based parallel programming for scalable matrix product algorithms
  • Agullo, Emmanuel
  • Buttari, Alfredo
  • Guermouche, Abdou
  • Herrmann, Julien
  • Jego, Antoine
January 2023

International audienceTask-based programming models have succeeded in gaining the interest of the hi...

Symmetric rank-k update on clusters of multicore processors with SMPSs
  • Badia Sala, Rosa Maria
  • Labarta Mancho, Jesús José
  • Marjanovic, Vladimir
  • Martín Huertas, Alberto Francisco
  • Mayo, Rafael
  • Quintana-Ortí, Enrique Salvador
  • Reyes, Ruymán

We investigate the use of the SMPSs programming model to leverage task parallelism in the execution ...

We use cookies to provide a better user experience.