Toward a universal mapping algorithm for accessing trees in parallel memory systems

The authors 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 are referred to as elementary templates. They 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. They also propose another mapping algorithm for a composite template, say /spl Vscr/ (as versatile), such that its size is not fixed and an instance of /spl Vscr/ is composed of any combination of c instances of elementary templates. The number of conflicts for accessing an S-node instance of template /spl Vscr/ is O(S//spl radic/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.

[1]  Sajal K. Das,et al.  Conflict-free data access of arrays and trees in parallel memory systems , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

[2]  Mikhail J. Atallah,et al.  Biased finger trees and three-dimensional layers of maxima: (preliminary version) , 1994, SCG '94.

[3]  Sajal K. Das,et al.  Load Balanced Mapping of Data Structures in Parallel Memory Modules for Fast and Conflict-Free Templates Access , 1997, WADS.

[4]  Sajal K. Das,et al.  Conflict-Free Path Access of Trees in Parallel Memory Systems with Application to Distributed Heap Implementation , 1995, ICPP.

[5]  S. Rao Kosaraju,et al.  Localized search in sorted lists , 1981, STOC '81.

[6]  Charles J. Colbourn,et al.  Conflict-Free Access to Parallel Memories , 1992, J. Parallel Distributed Comput..

[7]  Leonidas J. Guibas,et al.  A new representation for linear lists , 1977, STOC '77.

[8]  Vittorio Scarano,et al.  Multiple templates access of trees in parallel memory systems , 1997, Proceedings 11th International Parallel Processing Symposium.

[9]  Reiner Creutzburg,et al.  Recent Results on the Parallel Access to Tree-Like Data Structures: The Isotropic Approach , 1991, ICPP.

[10]  Sajal K. Das,et al.  Primal-target neural net heuristics for the hypergraph k-coloring problem , 1997, Proceedings of International Conference on Neural Networks (ICNN'97).

[11]  Kurt Mehlhorn,et al.  A new data structure for representing sorted lists , 1980, Acta Informatica.

[12]  Sajal K. Das,et al.  Conflict-free template access in k-ary and binomial trees , 1997, ICS '97.

[13]  Sajal K. Das,et al.  Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes , 1996, IEEE Trans. Parallel Distributed Syst..

[14]  Duncan H. Lawrie,et al.  The Prime Memory System for Array Access , 1982, IEEE Transactions on Computers.

[15]  Viktor K. Prasanna,et al.  Latin Squares for Parallel Array Access , 1993, IEEE Trans. Parallel Distributed Syst..