On the performance of transputer arrays for dense linear systems (Q921858)

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 4166702
Language Label Description Also known as
default for all languages
No label defined
    English
    On the performance of transputer arrays for dense linear systems
    scientific article; zbMATH DE number 4166702

      Statements

      On the performance of transputer arrays for dense linear systems (English)
      0 references
      1990
      0 references
      This paper presents the results of an experimental investigation of the computation and communication performance for single and multitransputer arrays. The study is focussed on the normalized arithmetic, concurrent floating and integer arithmetic, logarithmic array indexing, and on- chip/off-chip RAM; startup time, byte transfer rate, asymptotic link bandwidth, and the effect of the use of some performance maximization techniques on execution time. Also, the half performance message length for simultaneous operation of k \((k=1,...,4)\) links at 10/20 MHz clock in uni- and bidirectional modes is estimated. This study has been made for matrix factorization algorithms for dense linear systems, including LUD, Householder, Gauss-Jordan, Cholesky and Givens methods. The main directions of a future investigation are also presented.
      0 references
      LUD method
      0 references
      Householder method
      0 references
      Gauss-Jordan method
      0 references
      Cholesky method
      0 references
      experimental investigation
      0 references
      multitransputer arrays
      0 references
      normalized arithmetic
      0 references
      concurrent floating
      0 references
      integer arithmetic
      0 references
      logarithmic array indexing
      0 references
      on-chip/off-chip RAM
      0 references
      startup time
      0 references
      byte transfer rate
      0 references
      asymptotic link bandwidth
      0 references
      performance message length
      0 references
      matrix factorization algorithms
      0 references
      dense linear systems
      0 references
      Givens methods
      0 references

      Identifiers