Journal
PARALLEL COMPUTING
Volume 56, Issue -, Pages 1-17Publisher
ELSEVIER
DOI: 10.1016/j.parco.2016.04.001
Keywords
Sparse matrix; Column compressed format; Assemble; Matlab
Categories
Funding
- Swedish Research Council
Ask authors/readers for more resources
We develop and implement in this paper a fast sparse assembly algorithm, the fundamental operation which creates a compressed matrix from raw index data. Since it is often a quite demanding and sometimes critical operation, it is of interest to design a highly efficient implementation. We show how to do this, and moreover, we show how our implementation can be parallelized to utilize the power of modern multicore computers. Our freely available code, fully Matlab compatible, achieves about a factor of 5 x in speedup on a typical 6-core machine and 10 x on a dual-socket 16-core machine compared to the built-in serial implementation. (C) 2016 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available