Conflict-free access to parallel memories
Journal of Parallel and Distributed Computing
Biased finger trees and three-dimensional layers of maxima: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Conflict-free template access in k-ary and binomial trees
ICS '97 Proceedings of the 11th international conference on Supercomputing
Latin Squares for Parallel Array Access
IEEE Transactions on Parallel and Distributed Systems
Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Multiple Templates Access of Trees in Parallel Memory Systems
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Localized search in sorted lists
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A new representation for linear lists
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The Prime Memory System for Array Access
IEEE Transactions on Computers
Optimal Tree Access by Elementary and Composite Templates in Parallel Memory Systems
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing
Optimal Tree Access by Elementary and Composite Templates in Parallel Memory Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Mappings for Conflict-Free Access of Paths in Elementary Data Structures
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Bounded-Collision Memory-Mapping Schemes for Data Structures with Applications to Parallel Memories
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
We study the problem of mapping the N nodes of a complete t-ary tree on M memory modules so that they can be accessed in parallel by templates, i.e. distinct sets of nodes. Typical templates for accessing trees are subtrees, root-to-leaf paths, or levels which will be referred to as elementary templates.In this paper, we first propose a new mapping algorithm for accessing both paths and subtrees of size M with an optimal number of conflicts (i.e., only one conflict) when the number of memory modules is limited to M. We also propose another mapping algorithm for a composite template, say V (as versatile), such that its size is not fixed and an instance of V is composed of any combination of c instances of elementary templates. The number of conflicts for accessing an S-node instance of template V is O (S/驴M log M + c) and the memory load is 1 + o(1) where load is defined as the ratio between the maximum and minimum number of data items mapped onto each memory module.