Results 201 to 210 of about 24,777 (243)
Embedding hierarchical hypercube networks into the hypercube
IEEE Transactions on Parallel and Distributed Systems, 1997 The 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 +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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,
exaly +2 more sources
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,
exaly +2 more sources
IEEE Transactions on Parallel and Distributed Systems, 2005
This paper presents the exchanged hypercube, a new interconnection network obtained by systematically removing links from a binary hypercube. It maintains several desirable properties of the binary hypercube yet with reduced interconnection complexity.
Peter K. K. Loh +2 more
exaly +2 more sources
This paper presents the exchanged hypercube, a new interconnection network obtained by systematically removing links from a binary hypercube. It maintains several desirable properties of the binary hypercube yet with reduced interconnection complexity.
Peter K. K. Loh +2 more
exaly +2 more sources
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
Nian-Feng Tzeng, Sizheng Wei
exaly +3 more sources
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
Nian-Feng Tzeng, Sizheng Wei
exaly +3 more sources
Networks, 2002
AbstractIn this paper, we show how to give an orientation to the edges of an hypercube so that the inducedorientedhypercube offers approximately the same communication performance as that of the original nonoriented hypercube (routing, broadcasting, connectivity, etc.), that is, we show that it is possible to construct anN‐node oriented hypercube with ...
Fraigniaud, Pierre +2 more
openaire +4 more sources
AbstractIn this paper, we show how to give an orientation to the edges of an hypercube so that the inducedorientedhypercube offers approximately the same communication performance as that of the original nonoriented hypercube (routing, broadcasting, connectivity, etc.), that is, we show that it is possible to construct anN‐node oriented hypercube with ...
Fraigniaud, Pierre +2 more
openaire +4 more sources
Graphs and Combinatorics, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maria Axenovich +4 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maria Axenovich +4 more
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
Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1, 1988
The widespread use of parallel machines, and hypercubes in particular, is being held back by the lack of high-order parallel programming languages. In this paper we discuss the issues involved in establishing an existing language that supports parallel processing, that is to say Ada, on a hypercube multiprocessor.
Russell M. Clapp, Trevor N. Mudge
openaire +1 more source
The widespread use of parallel machines, and hypercubes in particular, is being held back by the lack of high-order parallel programming languages. In this paper we discuss the issues involved in establishing an existing language that supports parallel processing, that is to say Ada, on a hypercube multiprocessor.
Russell M. Clapp, Trevor N. Mudge
openaire +1 more source