Parallel realizations of Kanerva's sparse distributed memory on a tree-shaped computer

T. Hämäläinen, H. Klapuri, Jukka P. Saarinen, Kimmo Kaski

Research output: Contribution to journalArticleScientificpeer-review

1 Citation (Scopus)

Abstract

This paper presents two parallel realizations of sparse distributed memory (SDM) on a tree-shaped 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. (C)1997 by John Whey & Sons, Ltd.
Original languageEnglish
Pages (from-to)877-896
JournalConcurrency and Computation: Practice & Experience
Volume9
Issue number9
DOIs
Publication statusPublished - 1997
MoE publication typeA1 Journal article-refereed

Fingerprint Dive into the research topics of 'Parallel realizations of Kanerva's sparse distributed memory on a tree-shaped computer'. Together they form a unique fingerprint.

Cite this