𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by I. Gohberg; I. Koltracht; A. Averbuch; B. Shoham

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
644 KB
Volume
17
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

✦ Synopsis

Gohberg, I., I. Koltracht, A. Averbuch and B. Shoham, Timing analysis of a parallel algorithm for Toeplitz matrices on a MIMD parallel machine, Parallel Computing 17 (1991) 563-577_

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.

πŸ“œ SIMILAR VOLUMES

A network parallel genetic algorithm for
A network parallel genetic algorithm for the one machine sequencing problem
✍ M.K. Mayer πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 626 KB

This paper presents a network parallel genetic algorithm for the one machine sequencing problem. It examines a parallel genetic algorithm in which processors exchange their best solution found at periodic intervals and the case when no exchange is performed. The network parallel genetic algorithm is