Sciweavers

Share
PPOPP
2010
ACM

Applying the concurrent collections programming model to asynchronous parallel dense linear algebra

11 years 1 months ago
Applying the concurrent collections programming model to asynchronous parallel dense linear algebra
This poster is a case study on the application of a novel programming model, called Concurrent Collections (CnC), to the implementation of an asynchronous-parallel algorithm for computing the Cholesky factorization of dense matrices. In CnC, the programmer expresses her computation in terms of application-specific operations, partially-ordered by semantic scheduling constraints. We demonstrate the performance potential of CnC in this poster, by showing that our Cholesky implementation nearly matches or exceeds competing vendor-tuned codes and alternative programming models. We conclude that the CnC model is well-suited for expressing asynchronous-parallel algorithms on emerging multicore systems.
Aparna Chandramowlishwaran, Kathleen Knobe, Richar
Added 05 Mar 2010
Updated 08 Mar 2010
Type Conference
Year 2010
Where PPOPP
Authors Aparna Chandramowlishwaran, Kathleen Knobe, Richard W. Vuduc
Comments (0)
books