Variable-Dilation Embeddings of Hypercubes into Star Graphs: Performance Metrics, Mapping Functions, and Routing
نویسندگان
چکیده
We present load 1 embeddings of a k-dimensional hypercube Qk into an n-dimensional star graph Sn. Dimension i links of Qk are mapped into paths of length at most di in Sn, where di varies with i rather than being xed. Our embeddings are an attractive alternative to previously known techniques, producing small average dilation and small average congestion without sacriicing expansion. We provide a thorough characterization of our embeddings, which spans several combinations of node mapping functions and routing algorithms in Sn.
منابع مشابه
Low Expansion Packings and Embeddings of Hypercubes into Star Graphs: A Performance-Oriented Approach
| We discuss the problem of packing hypercubes into an n-dimensional star graph S(n), which consists of embedding a disjoint union of hypercubes U into S(n) with load 1. Hypercubes in U have from bn=2c to (n + 1) blog 2 nc ? 2 blog 2 nc+1 + 2 dimensions, i.e. they can be as large as any hypercube which can be embedded with dilation at most 4 into S(n). We show that U can be embedded into S(n) w...
متن کاملEmbedding hypercubes into pancake, cycle prefix and substring reversal networks
Among Cayley graphs on the symmetric group, some that have noticeably low diameter relative to the number of generators involved are the pancake network, burnt pancake network, and cycle prefix network [1,6,7,8]. Another such Cayley graph is the star network, and constructions have been given for one-to-one and one-tomany low dilation embeddings of hypercubes into star networks [11,12,15]. For ...
متن کاملEfficient Embeddings into Hypercube-like Topologies
Embeddings of various graph classes into hypercubes have been widely studied. Almost all these classes are regularly structured graphs such as meshes, complete trees or pyramids. In this paper, we present a general method for one-to-one embeddings of irregularly structured graphs into their optimal hypercubes, based on extended edge bisectors of graphs. An extended edge bisector is an edge bise...
متن کاملEmbeddings into the Pancake Interconnection Network
Owing to its nice properties, the pancake is one of the Cayley graphs that were proposed as alternatives to the hypercube for interconnecting processors in parallel computers. In this paper, we present embeddings of rings, grids and hypercubes into the pancake with constant dilation and congestion. We also extend the results to similar efficient embeddings into the star graph.
متن کامل[hal-00465652, v1] Embeddings into the Pancake Interconnection Network
Owing to its nice properties, the pancake is one of the Cayley graphs that were proposed as alternatives to the hypercube for interconnecting processors in parallel computers. In this paper, we present embeddings of rings, grids and hypercubes into the pancake with constant dilation and congestion. We also extend the results to similar efficient embeddings into the star graph.
متن کامل