Parallel implementations of convolution and moments algorithms on a multi-transputer system
β Scribed by Christopher J. Turner; Virendrakumar C. Bhavsar; Przemyslaw R. Pochec
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 767 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0141-9331
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We show how a reconfigurable network of transputers can be used to serve as a fast neural computing machine. Software implementation and hardware configuration are presented. The individual updating of the neurons in the neural network is performed following the parallel synchronous or maximum field
In this paper, we present a parallel sorting algorithm using the technique of multi-way merge. This algorithm, when implemented on a t dimensional mesh having n t nodes (t>2), sorts n t elements in O((t 2 &3t+2) n) time, thus offering a better order of time complexity than the [((t 2 &t) n log n)Γ2+
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.