𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Realizing the parallelism of array-based computation

✍ Scribed by Carl McCrosky

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

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Generalized multipartitioning of multi-d
Generalized multipartitioning of multi-dimensional arrays for parallelizing line-sweep computations
✍ Alain Darte; John Mellor-Crummey; Robert Fowler; Daniel Chavarrı́a-Miranda πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 546 KB

Multipartitioning is a strategy for decomposing multi-dimensional arrays into tiles and mapping the resulting tiles onto a collection of processors. This class of partitionings enables efficient parallelization of ''line-sweep'' computations that solve onedimensional recurrences along each dimension