• DocumentCode
    2199587
  • Title

    A parallel algorithm to solve tridiagonal systems on distributed memory multiprocessors

  • Author

    Badía, José M. ; Vidal, Antonio M.

  • Author_Institution
    Dept. de Sistemas Inf. y Comput., Univ. Politecnica de Valencia, Spain
  • fYear
    1993
  • fDate
    27-29 Jan 1993
  • Firstpage
    203
  • Lastpage
    210
  • Abstract
    The authors design and implement an efficient algorithm that uses the cyclic odd-even reduction method to solve large tridiagonal systems on a distributed memory multiprocessor. The algorithm works on a bidirectional array of transputers, and the code has been written in Occam2. The algorithm performs a parallel cyclic reduction of the original system, solves the reduced system using Gaussian elimination and obtains the remaining solutions with a cyclic backward substitution phase. They present both a theoretical and an experimental study of its performance on the Parsys SN-1000. Results reflect a real efficiency close to the theoretical maximum
  • Keywords
    matrix algebra; parallel algorithms; transputer systems; Gaussian elimination; Occam2; Parsys SN-1000; bidirectional array; cyclic backward substitution; cyclic odd-even reduction method; distributed memory multiprocessors; efficiency; parallel algorithm; parallel cyclic reduction; transputers; tridiagonal systems; Algorithm design and analysis; Costs; Distributed computing; Equations; Linear systems; Mathematics; Matrices; Parallel algorithms; Parallel machines;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel and Distributed Processing, 1993. Proceedings. Euromicro Workshop on
  • Conference_Location
    Gran Canaria
  • Print_ISBN
    0-8186-3610-6
  • Type

    conf

  • DOI
    10.1109/EMPDP.1993.336402
  • Filename
    336402