𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Calculating polynomial zeros on a local memory parallel computer

✍ Scribed by T.L Freeman

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
502 KB
Volume
12
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A new parallel matrix multiplication alg
A new parallel matrix multiplication algorithm on distributed-memory concurrent computers
✍ Choi, Jaeyoung πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 139 KB πŸ‘ 3 views

We present a new fast and scalable matrix multiplication algorithm called DIMMA (distribution-independent matrix multiplication algorithm) for block cyclic data distribution on distributed-memory concurrent computers. The algorithm is based on two new ideas; it uses a modified pipelined communicatio

Parallel realizations of Kanerva's spars
Parallel realizations of Kanerva's sparse distributed memory on a tree-shaped computer
✍ HΓ€mΓ€lΓ€inen, Timo; Klapuri, Harri; Saarinen, Jukka; Kaski, Kimmo πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 311 KB πŸ‘ 3 views

This paper presents two parallel realizations of sparse distributed memory (SDM) on a treeshaped computer. The original model of SDM is introduced in terms of generalized computer memory and artificial neural networks (ANNs). For parallellization purposes, addressing, storage and retrieval operation