A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is
We study the problem of mapping the N nodes of a c omplete t-ary tree o n M memory modules so that they can be a c cessed i n p arallel 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 t o a s elementary templates. In this paper, we rst propose a new mapping algorithm for accessing both paths and subtrees of size M with an optimal number of con icts i.e., only one conict when the number of memorydoi:10.1109/ipps.1998.669955 dblp:conf/ipps/AulettaDVPS98 fatcat:d3pm72ocyjae5mynfzca7ocw5m