Results 181 to 190 of about 67,481 (208)
Some of the next articles are maybe not open access.
Embedding hierarchical hypercube networks into the hypercube
IEEE Transactions on Parallel and Distributed Systems, 1997The embedding of one interconnection network into another is a very important issue in the design and analysis of parallel algorithms. Through such embeddings, the algorithms originally developed for one architecture can be directly mapped to another architecture.
Hamdi, Mounir, Song, SW
openaire +1 more source
Fault tolerance of hypercubes and folded hypercubes
The Journal of Supercomputing, 2013Let $$G = (V,E)$$ G = ( V , E ) be a connected graph. The conditional edge connectivity $$\lambda _\delta ^k(G)$$ ? ? k ( G ) is the cardinality of the minimum edge cuts, if any, whose deletion disconnects $$G$$ G and each component of $$G - F$$ G - F has $$\delta \ge k$$ ? ? k .
Guo, Litao, Guo, Xiaofeng
openaire +2 more sources
2018
Summary: Body centered structures are used as seeds for a variety of structures of rank 3 and higher. Propellane based structures are introduced and their design and topological properties are detailed.
openaire +2 more sources
Summary: Body centered structures are used as seeds for a variety of structures of rank 3 and higher. Propellane based structures are introduced and their design and topological properties are detailed.
openaire +2 more sources
Hypercubes and Multicommodity Flows
SIAM Journal on Discrete Mathematics, 1997Summary: The average degree of a subgraph \(H\) of the \(r\)-dimensional hypercube \(Q_r\) equals at most the maximum Hamming distance of any two nodes in \(H\). A corollary is that the minimum number of edges to delete from \(Q_r\) such that any two nodes at Hamming distance \(\ell\) are separated is \((r+1-\ell) 2^{r-1}\).
Yu, B., Cheriyan, J., Haxell, P. E.
openaire +2 more sources
IEEE Transactions on Computers, 1988
Since a k-dimensional hypercube has 2/sup k/ vertices, these systems are restricted to having exactly 2/sup k/ computing nodes. Because system sizes must be a power of two, there are large gaps in the sizes of systems that can be built with hypercubes. Routing and broadcast algorithms are presented for hypercubes that are missing certain of their nodes,
openaire +1 more source
Since a k-dimensional hypercube has 2/sup k/ vertices, these systems are restricted to having exactly 2/sup k/ computing nodes. Because system sizes must be a power of two, there are large gaps in the sizes of systems that can be built with hypercubes. Routing and broadcast algorithms are presented for hypercubes that are missing certain of their nodes,
openaire +1 more source
IEEE Transactions on Computers, 1991
A hypercube with extra connections added between pairs of nodes through otherwise unused links is investigated. The extra connections are made in a way that maximizes the improvement of the performance measure of interest under various traffic distributions. The resulting hypercube, called the enhanced hypercube, requires a simple routing algorithm and
N.-F. Tzeng, S. Wei
openaire +1 more source
A hypercube with extra connections added between pairs of nodes through otherwise unused links is investigated. The extra connections are made in a way that maximizes the improvement of the performance measure of interest under various traffic distributions. The resulting hypercube, called the enhanced hypercube, requires a simple routing algorithm and
N.-F. Tzeng, S. Wei
openaire +1 more source
Optimal embedding of hypercube into exchanged hypercube and optical multi-mesh hypercube
International Journal of Parallel, Emergent and Distributed SystemsPaul Immanuel, A. Berin Greeni
openaire +1 more source