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.

• Type: Conference
• Year: 2010
• Where: PPOPP
• Authors: Aparna Chandramowlishwaran, Kathleen Knobe, Richard W. Vuduc
• Keywords: Cholesky Factorization, Cholesky Implementation, CnC Model, Parallel Computing, PPOPP 2010