Parallel Processing Model for Cholesky Decomposition Algorithm in AlgoWiki Project
Supercomputing Frontiers and Innovations2016Vol. 3(3)
Citations Over TimeTop 17% of 2016 papers
Alexander Antonov, Alexey V. Frolov, Hiroaki Kobayashi, Igor Konshin, Alexey Teplov, Vadim Voevodin, Vladimir Voevodin
Abstract
The comprehensive analysis of algorithmic properties of well-known. Cholesky decomposition was performed on the basis of multifold AlgoWiki technologies. There was performed a detailed analysis of information graph, data structure, memory access profile, computation locality, scalability and other algorithm properties, that allow us to demonstrate a lot of unevident properties split up. into machine-independent and machine-dependent subsets. A comprehension of the parallel algorithm structure provide us with the possibility to efficiently implement the algorithm at hardware platform specified.
Related Papers
- → The factorability of symmetric matrices and some implications for statistical linear models(2001)6 cited
- → On the Cholesky algorithm with shifts for the eigensolution of real symmetric matrices(1981)2 cited
- INFLUENCE ANALYSIS OF CHOLESKY DECOMPOSITION(2010)
- → Application of square matrix decomposition in the prospectus of Cholesky algorithm(2021)