A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Optimizing Sparse Matrix Assembly in Finite Element Solvers with One-Sided Communication
[chapter]
2013
Lecture Notes in Computer Science
In parallel finite element solvers, sparse matrix assembly is often a bottleneck. Implemented using message passing, latency from message matching starts to limit performance as the number of cores increases. We here address this issue by using our own stack based representation of the sparse matrix, and a hybrid parallel programming model combining traditional message passing with one-sided communication. This gives an insertion rate up to more than twice as fast compared to state of the art implementations on a Cray XE6.
doi:10.1007/978-3-642-38718-0_15
fatcat:6mwavdob5bcwxlo263mgr4vie4