Implementing linear algebra algorithms on a Meiko Computing Surface (Q1181509): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Marián Vajteršic / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Marián Vajteršic / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0168-9274(91)90047-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078863623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3740904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large tridiagonal and block tridiagonal linear systems on vector and parallel computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vectorization of Linear Recurrence Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel Method for Tridiagonal Equations / rank
 
Normal rank

Latest revision as of 13:25, 15 May 2024

scientific article
Language Label Description Also known as
English
Implementing linear algebra algorithms on a Meiko Computing Surface
scientific article

    Statements

    Implementing linear algebra algorithms on a Meiko Computing Surface (English)
    0 references
    0 references
    0 references
    27 June 1992
    0 references
    The paper deals with implementation of some linear algebra algorithms on a transputer-based parallel computer system of Meiko. The vector plus scalar time vector (SAXPY) scalar product of two vectors (SDOT) and elementwise division of two vectors (VECDIV) operations are tested from the point of view of basic performance parameters. From the algorithms for solving linear systems of algebraic equations, the problems with respectively bidiagonal and tridiagonal matrices are chosen. Further, the block variant of the matrix-vector and transposed matrix-vector product is examined for a square mesh of processors. The contribution of the paper is to present detailed performance results of some concrete linear algebra computations on a distributive memory computer architecture consisting of 64 T800 transputers.
    0 references
    performance of parallel computing
    0 references
    transputer-based architecture
    0 references
    Meiko system
    0 references
    matrix-vector multiplication
    0 references
    linear algebra algorithms
    0 references
    transputer-based parallel computer system
    0 references
    scalar product
    0 references
    elementwise division
    0 references
    bidiagonal and tridiagonal matrices
    0 references
    distributive memory computer architecture
    0 references

    Identifiers