By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
V. Auletta ; Dipt. di Inf. ed Applicazioni, Salerno Univ., Italy ; S. K. Das ; A. De Vivo ; M. C. Pinotti
more authors

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 𝒱 (as versatile), such that its size is not fixed and an instance of 𝒱 is composed of any combination of c instances of elementary templates. The number of conflicts for accessing an S-node instance of template 𝒱 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

Published in:

Parallel Processing Symposium, 1998. IPPS/SPDP 1998. Proceedings of the First Merged International ... and Symposium on Parallel and Distributed Processing 1998

Date of Conference:

30 Mar-3 Apr 1998