Date Added: Jan 2010
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. The authors demonstrate the performance potential of CnC in this poster, by showing that their Cholesky implementation nearly matches or exceeds competing vendor-tuned codes and alternative programming models. They conclude that the CnC model is well-suited for expressing asynchronous-parallel algorithms on emerging multicore systems.