Timing analysis of a parallel algorithm for Toeplitz matrices on a MIMD parallel machine

I. Gohberg*, I. Koltracht, A. Averbuch, B. Shoham

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

13 Scopus citations

Abstract

In this paper performance analysis of a parallel Levinson-type algorithm for Toeplitz matrices is given. A modified version of the parallel algorithm is presented to improve performance. The algorithm is implemented on a shared-memory MIMD (non-vector) machine. The derivation of the parallel algorithm is presented. The speedup limitation is investigated along with the optimal number of processors needed to a given Toeplitz matrix.

Original languageEnglish
Pages (from-to)563-577
Number of pages15
JournalParallel Computing
Volume17
Issue number4-5
DOIs
StatePublished - Jul 1991

Funding

FundersFunder number
National Science Foundation8801961

    Keywords

    • Levinson-type algorithm
    • Toeplitz matrix
    • shared memory (MIMD) machine

    Fingerprint

    Dive into the research topics of 'Timing analysis of a parallel algorithm for Toeplitz matrices on a MIMD parallel machine'. Together they form a unique fingerprint.

    Cite this