Parallel Processing Model for Cholesky Decomposition Algorithm in AlgoWiki Project | Zendy

Alexander Antonov | Zendy; Alexey V. Frolov | Zendy; Hiroaki Kobayashi | Zendy; Igor Konshin | Zendy; Alexey Teplov | Zendy; Vadim Voevodin | Zendy; Vladimir Voevodin | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Parallel Processing Model for Cholesky Decomposition Algorithm in AlgoWiki Project

Author(s) -

Alexander Antonov,

Alexey V. Frolov,

Hiroaki Kobayashi,

Igor Konshin,

Alexey Teplov,

Vadim Voevodin,

Vladimir Voevodin

Publication year - 2016

Publication title -

supercomputing frontiers and innovations

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.375

H-Index - 16

eISSN - 2409-6008

pISSN - 2313-8734

DOI - 10.14529/jsfi160307

Subject(s) - cholesky decomposition , minimum degree algorithm , computer science , scalability , locality , computation , decomposition , algorithm , parallel computing , graph , theoretical computer science , data structure , incomplete cholesky factorization , programming language , database , ecology , linguistics , eigenvalues and eigenvectors , physics , philosophy , quantum mechanics , biology

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research