Summary: Timing Analysis of a Parallel Algorithm for
Toeplitz Matrices on a MIMD Parallel machine
appeared in Parallel Computing, Vol. 17, pp. 563­577, 1991
I. Gohberg y I. Koltracht z \Lambda
A. Averbuch y B. Shoham y
y School of Mathematical Sciences
Tel­Aviv University
Tel­Aviv 69978, Israel
z The College of Liberal Arts and Sciences
The University of Connecticut
Department of Mathematics
196 Auditorium Road
Storrs, Connecticut 06268, USA
E­Mail: amir@MATH.TAU.AC.IL
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

Source: Averbuch, Amir - School of Computer Science, Tel Aviv University

Collections: Computer Technologies and Information Sciences