By Topic

Embedding arbitrary trees in the hypercube and the q-dimensional mesh

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
$31 $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

3 Author(s)
Gaber, J. ; LIFL, Lille I Univ., Villeneuve d''Ascq, France ; Tsursel, B. ; Goncalves, G.

A general data movement technique was described by D. Nassimi and S. Sahni (1981) which often leads to efficient parallel algorithms on distributed-memory architectures for a wide class of problems. In this paper, by using the same arguments that was used to prove correctness of this technique, we show that the data movement operations involved may be reduced by a constant factor under some assumptions. We show also that this technique and the optimization can be utilized to embed arbitrary trees in the hypercube and the q-dimensional mesh by using a similar algorithm of the randomized flip-bit algorithm, described by F.T. Leighton (1992). We show that these embedding algorithms embed any M-node tree in N-PEs hypercube or N-PE's q-dimensional mesh with load O(M/N), which is optimal for all M

Published in:

High Performance Computing, 1996. Proceedings. 3rd International Conference on

Date of Conference:

19-22 Dec 1996