𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Conflict-free access to parallel memories

✍ Scribed by Charles J. Colbourn; Katherine Heinrich

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
837 KB
Volume
14
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Optimal Mappings of q-ary and Binomial T
Optimal Mappings of q-ary and Binomial Trees into Parallel Memory Modules for Fast and Conflict-Free Access to Path and Subtree Templates
✍ Sajal K. Das; M.Cristina Pinotti πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 444 KB

The main memory access latency can significantly slow down the overall performance of a computer system due to the fact that average cycle time of the main memory is typically a factor of 5 10 times higher than that of a processor. To cope with this problem, in addition to the use of caches, the mai

Multiple Templates Access of Trees in Pa
Multiple Templates Access of Trees in Parallel Memory Systems
✍ Vincenzo Auletta; Amelia De Vivo; Vittorio Scarano πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 179 KB

We study the problem of mapping the N nodes of a data structure on M memory modules so that they can be accessed in parallel by templates, i.e., distinct sets of nodes. In literature several algorithms are available for arrays (accessed by rows, columns, diagonals, and subarrays) and trees (accessed