Massive Asynchronous Parallelization of Sparse Matrix Factorizations
- Georgia Inst. of Technology, Atlanta, GA (United States)
Solving sparse problems is at the core of many DOE computational science applications. We focus on the challenge of developing sparse algorithms that can fully exploit the parallelism in extreme-scale computing systems, in particular systems with massive numbers of cores per node. Our approach is to express a sparse matrix factorization as a large number of bilinear constraint equations, and then solving these equations via an asynchronous iterative method. The unknowns in these equations are the matrix entries of the factorization that is desired.
- Research Organization:
- Georgia Institute of Technology, Atlanta, GA (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)
- DOE Contract Number:
- SC0012538
- OSTI ID:
- 1416151
- Report Number(s):
- 2017-1
- Country of Publication:
- United States
- Language:
- English
Similar Records
A Novel Coarsening Method for Scalable and Efficient Mesh Generation
A massively parallel discrete ordinates response matrix method for neutron transport
A discrete ordinate response matrix method for massively parallel computers
Technical Report
·
Thu Dec 02 00:00:00 EST 2010
·
OSTI ID:1416151
A massively parallel discrete ordinates response matrix method for neutron transport
Journal Article
·
Fri May 01 00:00:00 EDT 1992
· Nuclear Science and Engineering; (United States)
·
OSTI ID:1416151
A discrete ordinate response matrix method for massively parallel computers
Conference
·
Tue Dec 31 00:00:00 EST 1991
·
OSTI ID:1416151