Parallel quadrant interlocking factorization on hypercube computers (Q919737)

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 4162139
Language Label Description Also known as
default for all languages
No label defined
    English
    Parallel quadrant interlocking factorization on hypercube computers
    scientific article; zbMATH DE number 4162139

      Statements

      Parallel quadrant interlocking factorization on hypercube computers (English)
      0 references
      1990
      0 references
      Starting from the WZ factorization of matrices the quadrant interlocking factorization method (QIF) for solving systems of linear equations is presented in a brief summary. Next the authors discuss those aspects of hypercube computer architecture that are essential for their numerical application and present a general technique, how to decompose a sequential algorithm into parallel processes on a hypercube. They also introduce an extension of the computer language C for programming their hypercube. Applying those techniques they develop the parallel WZ and QIF algorithms and give their code listing. The paper concludes with a complexity analysis of the algorithm and a discussion of the effect of the hypercube dimension on efficiency.
      0 references
      parallel computation
      0 references
      WZ factorization
      0 references
      quadrant interlocking factorization method
      0 references
      hypercube computer architecture
      0 references
      computer language C
      0 references
      complexity
      0 references
      efficiency
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers