A. Gupta and S. Hambrusch. Multiple Network Embeddings into Hypercubes. Proc. of the 5th DMCC, Charleston, SC, April 1990.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....log 2 N=log h N) and load L. Embeddings of a single connected graph into a host graph is not directly applicable to a practical system sometimes because a parallel system frequently runs multiple jobs at a time. Thus, embeddings of multiple graphs into a host graph have been also highly demanded [2, 8, 20]. We say that C copies of an N node graph are optimally embedded into a p CN Theta p CN hypermesh if i) the nodes of the copies were mapped by a bijection onto the nodes of the hypermesh (optimal expansion) ii) the dilation was one (optimal dilation) and iii) each hyper edge was assigned ....

A. K. Gupta and S. E. Hambrusch, "Multiple network embeddings into hypercubes," J. Parallel and Distrib. Comput., Vol. 19, pp. 73-82, 1993.

....cost. Embeddings of a single connected graph into a host graph are not always applicable to a practical system because a parallel system frequently runs multiple jobs at a time. Thus, embeddings of multiple copies of a graph into a host graph have been extensively studied in the literature [1, 5, 17]. Embeddings of multiple copies of a graph into a hypermesh have been studied in [9] Multiple copies of a graph are said to be optimally embedded into a hypermesh if the embedding is optimal in all respects of expansion, congestion, and alignment cost. Kim and Chwa [9] optimally embedded multiple ....

A. K. Gupta and S. E. Hambrusch, "Multiple network embeddings into hypercubes," J. Parallel and Distrib. Comput., Vol. 19, pp. 73-82, 1993.

....important measures [1, 11] Embeddings of a single connected graph into a host graph is not directly applicable to a practical system sometimes because a parallel system frequently runs multiple jobs at a time. Thus, embeddings of multiple graphs into a host graph have been also highly demanded [2, 8, 18]. An embedding of C copies of an N node graph into a p CN Theta p CN MOB is said to be optimal if i) the mapping from the nodes of the copies to the nodes of the MOB is a bijection (optimal expansion) ii) the dilation is one (optimal dilation) and iii) each bus of the MOB is assigned exactly ....

A. K. Gupta and S. E. Hambrusch, "Multiple network embeddings into hypercubes, " J. Parallel and Distrib. Comput., Vol. 19, pp. 73-82, 1993.

....cost. Embeddings of a single connected graph into a host graph are not always applicable to a practical system because a parallel system frequently runs multiple jobs at a time. Thus, embeddings of multiple copies of a graph into a host graph have been extensively studied in the literature [14,15,16]. Embeddings of multiple copies of a graph into a hypermesh have been studied in [12] Multiple copies of a graph are said to be optimally embedded into a hypermesh if the embedding is optimal in all respects of expansion, congestion, and alignment cost. Kim and Chwa [12] optimally embedded ....

A. K. Gupta and S. E. Hambrusch, Multiple network embeddings into hypercubes, J. Parallel and Distrib. Comput. 19 (1993) 73--82.

....6.2, the algorithm produces the natural cycletree as shown in Figure 11. The dashed lines correspond to the edge set E in the algorithm. 7 Embedding of binary tree based networks Embedding of circular and linear arrays, binary trees and binary tree based networks, like X trees [11] leap trees [20], back to back trees [13] de Bruijn networks [42] and completely linked trees, in other networks such as hypercubes [20, 35, 37, 48, 49] meshes [28, 43, 54] rings [23] pyramids [12] butterflies [40] and VLSI arrays [18, 22, 41, 53] have been studied extensively. Several of those techniques ....

....in the algorithm. 7 Embedding of binary tree based networks Embedding of circular and linear arrays, binary trees and binary tree based networks, like X trees [11] leap trees [20] back to back trees [13] de Bruijn networks [42] and completely linked trees, in other networks such as hypercubes [20, 35, 37, 48, 49], meshes [28, 43, 54] rings [23] pyramids [12] butterflies [40] and VLSI arrays [18, 22, 41, 53] have been studied extensively. Several of those techniques and results apply directly, or with minor modifications, to cycletrees. Large virtual networks can be simulated by smaller networks by ....

[Article contains additional citation context not shown here]

Gupta, A. K. and Hambrusch, S. E., Multiple Network Embeddings into Hypercubes, J. Parallel and Distributed Computing, 19:73--82 (1993).

No context found.

A. Gupta and S. Hambrusch. Multiple Network Embeddings into Hypercubes. Proc. of the 5th DMCC, Charleston, SC, April 1990.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC