𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


Neural computing on a system of parallel
✍ Diethelm WΓΌrtz; Georg Hartung πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 883 KB

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

Parallel Sorting Algorithm Using Multiwa
✍ Bhabani P. Sinha; Amar Mukherjee πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 288 KB

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+

Performance modelling of three parallel
✍ 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.