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:Programming and computer software Vol. 48; no. 2; pp. 90 - 101
Main Authors: Malaschonok, G. I., Sidko, A. A.
Format: Journal Article
Language:English
Published: Moscow Pleiades Publishing 01.04.2022
Springer Nature B.V
Subjects:
Algorithms
Artificial Intelligence
Cholesky factorization
Computer Science
Decentralized control
Distributed memory
Experiments
Mathematical analysis
Operating Systems
Software Engineering
Software Engineering/Programming and Operating Systems
Sparse matrices
Supercomputers
Workloads
ISSN:0361-7688, 1608-3261
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:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0361-7688
1608-3261
DOI:10.1134/S0361768822020086