By Topic

Low expansion packings and embeddings of hypercubes into star graphs

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

1 Author(s)

Let G(κ) and H(n) be respectively a κ-dimensional and an n-dimensional graph. Packing is a technique by which pκ many copies of each G(κ), κmin⩽κ⩽κmax, are embedded into H(n). Packings can use H(n) efficiently by assigning independent tasks to the embedded copies of G(κ), and are a useful foundation, from which node allocation and task migration strategies can be built. Copies of G(κ), packed into H(n) with dilation dbase, can be combined to produce a variable-dilation embedding of G(κ+l) into H(n). Such an embedding has dilation d i along dimension i of G(κ+l), where di=d base for i⩽κ, and di>dbase for κ<i⩽κ+l. The average dilation of the embedding is davr=1/(κ+l)Σi=1κ+ld i, and can often be made close to dbase. This paper focuses on the problem of packing hypercubes Q(κ) into a star graph S(n) with load 1 and dilation 3. Our results include: 1) fixed-sized packings of Q(κ) into S(n), 2) multiple-sized packings of Q(κ) into S(n), and 3) variable-dilation embeddings of Q(κ+l) into S(n). Our variable-dilation embeddings and multiple-sized packings provide flexibility to support tasks with a wide range of node allocation requirements. The expansion of our multiple-sized packings is optimal (i.e., 1), which solves the problem of growing expansion found in single embeddings of hypercubes into star graphs. Moreover, for n⩽10, the average dilation of our variable-dilation embeddings lies between 3 and 4.25

Published in:

Computers and Communications, 1996., Conference Proceedings of the 1996 IEEE Fifteenth Annual International Phoenix Conference on

Date of Conference:

27-29 Mar 1996