By Topic

Edge-disjoint embedding of large full binary trees into hypercubes

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

2 Author(s)
Sook-Yeon Kim ; Dept. of Comput. Sci., Korea Adv. Inst. of Sci. & Technol., Seoul, South Korea ; Kyung-Yong Chwa

We present two embedding methods of the full binary tree into the hypercube when the tree has greater number of nodes than the hypercube. Both methods map the tree edges onto the edge-disjoint paths of the hypercube(each hypercube edge being considered as two anti-parallel directed edges), and distribute the same level tree nodes evenly to the hypercube nodes. One embedding method with the optimal dilation has a load factor greater than the optimal valve by one. And the other embedding method with the optimal load factor has a dilation greater than the optimal value by one. Furthermore, we show that both the dilation and load factor can not be optimized simultaneously when the same level tree nodes are evenly distributed

Published in:

Parallel and Distributed Processing, 1995. Proceedings. Seventh IEEE Symposium on

Date of Conference:

25-28 Oct 1995