Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
×
In this paper we consider the problem of embedding r guest networks G0, ..., Gr−1, into a k-dimensional hypercube H so that every processor of H is assigned ...
In this paper we study the problem of how to efficiently embed r intercon- nection networks Go, ... ,Gr _ ll r :$ k, into a k-dimensional hypercube H so.
In this paper we consider the problem of embedding r guest networks G0, ..., Gr−1, into a k-dimensional hypercube H so that every processor of H is assigned ...
Authors. Ajay K. Gupta · Susanne E. Hambrusch, Purdue UniversityFollow ; Date of this Version. 1989 ; Tech Report Number. 89-878 ; Number of Pages. 24.
In the study of parallel computing, networks of processors are often organized into various configurations such as trees, pyramids, and mesh arrays [1-11].
People also ask
We survey the known results concerning such embeddings, including expansion/dilation tradeoffs for general graphs, embeddings of meshes and trees, packings of ...
In this paper an approach for embedding linear array onto Tree-. Hypercubes networks is proposed. INTRODUCTION. Many network issues such as network cost, ...
Missing: Multiple | Show results with:Multiple
We present an efficient multiple-copy embedding of the cube-connected-cycles net- work within the hypercube. This embedding is used to derive efficient multiple ...
As hypercubes are often viewed as universal and capable of simulating other architectures efficiently, we investigate embeddings of star network into hypercubes ...
Missing: Multiple | Show results with:Multiple
Abstract-The star interconnection network has recently been suggested as an afternative to the hypercube. As hypercubes are.