The formal development of a parallel program performing LU-decomposition (Q1096311): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Systolic algorithms as programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3925859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational models and task scheduling for parallel sparse Cholesky factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic proof technique for parallel programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying properties of parallel programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3857636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A derivation of distributed implementation of Warshall's algorithm / rank
 
Normal rank

Latest revision as of 13:50, 18 June 2024

scientific article
Language Label Description Also known as
English
The formal development of a parallel program performing LU-decomposition
scientific article

    Statements

    The formal development of a parallel program performing LU-decomposition (English)
    0 references
    0 references
    1988
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    parallel algorithm
    0 references
    LU-decomposition
    0 references
    Gries-Owicki approach
    0 references
    parallel invariant
    0 references
    efficiency
    0 references
    correctness
    0 references