Namerical Algorithms (Session 3.2)


Volume 237 of the series Lecture Notes in Computer Science pp 247-254


Gauss elimination algorithms for mimd computers

  • M. CosnardAffiliated withCNRS, Laboratoire TIM3
  • , M. MarrakchiAffiliated withCNRS, Laboratoire TIM3
  • , Y. RobertAffiliated withCNRS, Laboratoire TIM3
  • , D. TrystramAffiliated withEcole Centrale PARIS

* Final gross prices may vary according to local VAT.

Get Access


This paper uses a graph-theoretic approach to analyse the performances of several parallel variations of the Gaussian triangularization algorithm on an MIMD computer. Dongarra et al. [DGK] have studied various parallel implementations of this method for a vector pipeline machine. We obtain complexity results permitting to select among these parallel algorithms.