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

On parallel scan-conversion algorithms for transputer networks

โœ Scribed by H.E. Bez; L. Parks

Publisher
Elsevier Science
Year
1990
Weight
937 KB
Volume
13
Category
Article
ISSN
0745-7138

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A parallel FFT algorithm for transputer
A parallel FFT algorithm for transputer networks
โœ Yonggen Huang; Yakup Paker ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 468 KB

Huang, Y. and Y Paker, A parallel FFT algorithm for transputer networks, Parallel Computing 17 (1991) 895-906 This paper presents a parallel FFT algorithm suitable for MIMD machines\_ It has the properties of uniform granularity, the dominance of computation, and suitability to large data matrices T

Parallel Jacobi algorithm for matrix dia
Parallel Jacobi algorithm for matrix diagonalisation on transputer networks
โœ P. Tervola; W. Yeung ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 441 KB

Tervola, P. and W. Yeung, Parallel Jacobi algorithm for matrix diagonalisation on transputer networks, Parallel Computing 17 (1991) 155-163 We present a parallel algorithm for the determination of the eigenvalues and eigenvectors of a real symmetric matrix. The algorithm allocates a certain number o

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.