Timing analysis of a parallel algorithm for Toeplitz matrices on a MIMD parallel machine (Q1179257)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Timing analysis of a parallel algorithm for Toeplitz matrices on a MIMD parallel machine |
scientific article; zbMATH DE number 24157
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Timing analysis of a parallel algorithm for Toeplitz matrices on a MIMD parallel machine |
scientific article; zbMATH DE number 24157 |
Statements
Timing analysis of a parallel algorithm for Toeplitz matrices on a MIMD parallel machine (English)
0 references
26 June 1992
0 references
The authors present and implement a Levinson-type algorithm for solving Toeplitz systems on a shared bus and a shared memory parallel MIMD machine. They observed that the speedup depends on the matrix size. For a large matrix the efficiency is over \(75\%\). Processing time of the algorithm for a fixed size Toeplitz matrix decreases when the number of processors increases, up to an optimal number of processors due to the limitation of the communication through the shared bus.
0 references
timing analysis
0 references
parallel algorithm
0 references
Levinson-type algorithm
0 references
Toeplitz systems
0 references
shared bus
0 references
shared memory
0 references
parallel MIMD machine
0 references
efficiency
0 references
Toeplitz matrix
0 references
0.8772383
0 references
0.8766831
0 references
0.8738241
0 references
