Multiple Templates Access of Trees in Parallel Memory Systems

Mappings for Conflict-Free Access of Paths in Bidimensional Arrays, Circular Lists, and Complete Trees

“…To exploit to the fullest extent the performance of the multibank partition, mapping schemes can be employed that avoid or minimize the memory conflicts [15]. Since it is hard to find universal mappings} mappings that minimize conflicts for arbitrary memory access patterns}several specialized mappings, designed for accessing regular patterns in specific data structures, have been proposed in the literature (see [2,12] for a complete list of references).…”

c-Perfect Hashing Schemes for Binary Trees, with Applications to Parallel Memories

“…Strategies for mapping tree structures considered conflict-free access for one elementary template-either complete subtrees or root-to-leaf paths or levels [6,7] or combinations thereof [2], but the only study that even approaches the universality of our result-i.e., access to any subtree-is the C-template ("C" for "composite") of [1], whose instances are combinations of different numbers of distinct elementary templates. The mapping strategy presented for the Ctemplates' instances of size K, with M memory modules, achieves O(K/M + c) conflicts.…”