๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Parallel Gram-Schmidt orthogonalisation on a network of transputers

โœ Scribed by L.C. Waring; M. Clint

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

No coin nor oath required. For personal study only.

โœฆ Synopsis

Waring, L.C. and M. Clint, Parallel Gram-Schmidt orthogonalisation on a network of transputers, Parallel Computing 17 (1991) 1043-1050_

A parallel algorithm to perform modified Gram-Schmidt orthogonalisation of a set of vectors using an MIMD architecture is described. An array of transputers configured in a simple pipeline topology is used for the computation. The speedup obtained by using P processors asymptotically approaches P/2 when the size of the problem becomes large_

๐Ÿ“œ SIMILAR VOLUMES

Performance modelling of three parallel
Performance modelling of three parallel sorting algorithms on a pipelined transputer network
โœ Narasimhan, V. Lakshmi; Armstrong, J. ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 961 KB

The implementation of three parallel sorting algorithms, namely binary sort, odd-even transposition sort and bitonic sort, on a network of transputers is analysedin the paper. The variation in the performance of these algorithms as the number of processors and sort size are changed is investigated.