Fast Matlab compatible sparse assembly on multicore computers release_gp4tanqylvg23jbrzrbb6me5zu

by Stefan Engblom, Dimitar Lukarski

Released as a article .

2015  

Abstract

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 times in speedup on a typical 6-core machine and 10 times on a dual-socket 16 core machine compared to the built-in serial implementation.
In text/plain format

Archived Files and Locations

application/pdf  456.4 kB
file_hs3wkrgdird3zngrhaocuqkqmi
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   accepted
Date   2015-10-23
Version   v3
Language   en ?
arXiv  1406.1066v3
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 42e57036-06f9-4bb2-a33f-e56aecc7e4e9
API URL: JSON