Efficient Calculation Managing on a Cluster with Distributed Memory: [preprint]

dc.contributor.authorIlchenko, E.
dc.contributor.authorMalaschonok, Gennadi
dc.date.accessioned2018-07-02T13:40:48Z
dc.date.available2018-07-02T13:40:48Z
dc.date.issued2017
dc.description.abstractManaging of cluster parallel computations for tree-like recursive algebraic algorithms for the case of cluster with distributed memory is one of the diffcult problems of computer algebra. The block-recursive algorithms of matrix and polynomial multiplication, Strassen's and Karatsuba's algorithms, matrix inversion and computation of the kernel of a matrix operator, LDU and Bruhat factorization are examples of such algorithms. We suggest a scheme with multidispatching for management of such parallel computing processes and demonstrate the results of experiments at the JSC RAS cluster MVS-10P.en_US
dc.identifier.citationIlchenko E. Efficient Calculation Managing on a Cluster with Distributed Memory / Evgeny Ilchenko, Gennadi Malaschonok // International conference Polynomial Computer Algebra. - Saint-Petersburg, 2017. - P. 56-61.en_US
dc.identifier.urihttps://ekmair.ukma.edu.ua/handle/123456789/13474
dc.language.isoenen_US
dc.relation.sourceInternational conference Polynomial Computer Algebraen_US
dc.statusfirst publisheden_US
dc.subjectcomputer algebraen_US
dc.subjectblock-recursive matrix algorithmsen_US
dc.subjectcomputing processesen_US
dc.subjectclusteren_US
dc.subjectthesisen_US
dc.subjectpreprinten_US
dc.titleEfficient Calculation Managing on a Cluster with Distributed Memory: [preprint]en_US
dc.typePreprinten_US
dc.typeConference materialsen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Efficient_Calculation_Managing_on_a_Cluster_with_Distributed_Memory.pdf
Size:
262.34 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
7.54 KB
Format:
Item-specific license agreed upon to submission
Description: