Live Webcast 15th Annual Charm++ Workshop

-->
Libraries and Algorithms:
Dense LU Factorization

CharmLU is a high-performance dense LU solver library that is highly scalable and follows the HPCC specification. In 2011, it won an HPCC award for best performance as part of a set of benchmarks.

The implementation is designed to be composable with user-level application code.

In addition, the chare array mapping flexibility built into Charm++ helps to minimize coupling with control flow code and allows the user or library developer to explore various mappings of block to processor easily.

People
Papers/Talks
12-05
2012
[Talk]
Composable Libraries for Parallel Programming [PPSC 2012]
11-51
2012
[Paper]
Mapping Dense LU Factorization on Multicore Supercomputer Nodes [IPDPS 2012]
11-49
2011
[Paper]
Charm++ for Productivity and Performance: A Submission to the 2011 HPC Class II Challenge [SC 2011]
11-34
2011
[Paper]
Exploring Partial Synchrony in an Asynchronous Environment Using Dense LU [PPL Technical Report 2011]