Parallel realizations of Kanerva's sparse distributed memory on a tree-shaped computer
✍ Scribed by Hämäläinen, Timo; Klapuri, Harri; Saarinen, Jukka; Kaski, Kimmo
- Publisher
- John Wiley and Sons
- Year
- 1997
- Tongue
- English
- Weight
- 311 KB
- Volume
- 9
- Category
- Article
- ISSN
- 1040-3108
No coin nor oath required. For personal study only.
✦ Synopsis
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 operations are explained in detail. Some existing implementations in various computing platforms are considered before introducing the tree-shaped parallel computer, TUTNC (Tampere University of Technology Neural Computer). Two mappings are given, each utilizing parallelism with different granularities, and compared in terms of measured execution time, task partitioning and load balancing. Performance estimates are given for a larger system. The results show that SDM can be well parallelized in TUTNC.