No label defined (Q3975665)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 18296
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 18296

      Statements

      0 references
      26 June 1992
      0 references
      graph-theoretic method
      0 references
      survey article
      0 references
      Gauss-Jordan method
      0 references
      Cholesky factorization
      0 references
      Doolittle method
      0 references
      QR factorization
      0 references
      parallel factorization algorithms
      0 references
      dense linear systems
      0 references
      shared memory model of computation
      0 references
      distributed memory architectures
      0 references
      sequential algorithm
      0 references
      scheduling algorithms
      0 references
      Gauss elimination
      0 references
      Givens factorization
      0 references
      complexity
      0 references
      [For the entire collection see Zbl 0729.00015.] This paper surveys about thirty papers published in the last decade on the design and analysis of parallel factorization algorithms for solving dense linear systems of algebraic equations, with restriction to shared memory model of computation (a paper by Robert in this volume taking care of distributed memory architectures), and with emphasis on theory (not including experimental results on real computers). The discussion includes a graph-theoretic approach by which the design of a parallel algorithm is separated into two independent parts, namely, (i) the construction of a task system and determination of the precedence constraints and of the task graph associated with a sequential algorithm, (ii) the construction of scheduling algorithms compatible with the task graph. Tools for analyzing parallel algorithms associated with a sequential algorithm are discussed and applied to Gauss-Jordan, several Gauss elimination algorithms, Cholesky, Doolittle and QR. The paper concludes with an investigation of the parallelization of Givens factorization and a review of some complexity results.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references