Multiple Templates Access of Trees in Pa
โ
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