The open archive for STFC research publications

Full Record Details

DOI 10.5286/raltr.2008029
Persistent URL http://purl.org/net/epubs/work/49640
Record Status Checked
Record Id 49640
Title A DAG-based parallel Cholesky factorization for multicore systems
Abstract Modern processors have multiple cores, making multiprocessing essential for competitive desktop linear algebra. Asynchronous processing with much inherent parallelism can be derived by using a directed acyclic graph (DAG) to represent the data dependencies between tasks. In this paper, we present our implementation of a DAG-based Cholesky factorization, using a last minute scheduling approach to prioritise tasks. Our factorization is implemented in Fortran 95 using OpenMP.
Organisation CSE , CSE-NAG , STFC
Keywords Fortran 95 , parallel , Cholesky factorization , DAG-based , symmetric linear systems , OpenMP
Funding Information
Related Research Object(s):
Licence Information:
Language English (EN)
Type Details URI(s) Local file(s) Year
Report RAL Technical Reports RAL-TR-2008-029. STFC, 2008. DAGParCholesky.pdf 2008