Supercomputer Environment for Recursive Matrix Algorithms

A new runtime environment for the execution of recursive matrix algorithms on a supercomputer with distributed memory is proposed. It is designed both for dense and sparse matrices. The environment ensures decentralized control of the computation process. As an example of a block recursive algorithm...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org
Main Authors: Malaschonok, Gennadi, Sidko, Alla
Format: Paper
Language:English
Published: Ithaca Cornell University Library, arXiv.org 20.03.2023
Subjects:
Algorithms
Cholesky factorization
Decentralized control
Distributed memory
Mathematical analysis
Sparse matrices
Supercomputers
ISSN:2331-8422
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A new runtime environment for the execution of recursive matrix algorithms on a supercomputer with distributed memory is proposed. It is designed both for dense and sparse matrices. The environment ensures decentralized control of the computation process. As an example of a block recursive algorithm, the Cholesky factorization of a symmetric positive definite matrix in the form of a block dichotomous algorithm is described. The results of experiments with different numbers of cores are presented, demonstrating good scalability of the proposed solution.
Bibliography:SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
ISSN:2331-8422
DOI:10.48550/arxiv.2303.11017