The determination of the diameter of an interconnection network is essential in evaluating the performance of the network. Parallelogramic honeycomb torus is an attractive alternative to classical torus network due to smaller vertex degree, and hence, lower implementation cost. In this paper, we present the expression for the diameter of a parallelogramic, honeycomb torus, which extends a known result about rhombic: honeycomb torus. (c) 2005 Elsevier Ltd. All rights reserved
The study of the diameter of the graph of polyhedra is a classical problem in the theory of linear p...
It has become fashionable to argue against research on new interconnection networks by claiming that...
Abstract. The bisection width of interconnection networks has always been im-portant in parallel com...
AbstractThe determination of the diameter of an interconnection network is essential in evaluating t...
AbstractThe effectiveness of an interconnection network is one of the dominating performance factors...
International audienceWe define the higher dimensional honeycomb graphs as a generalization of hexag...
We dene the higher dimensional honeycomb graphs as a generalization of hexagonal plane tessellation,...
We present an optimal embedding of a honeycomb network (honeycomb mesh and honeycomb torus) of size ...
The degree diameter problem involves finding the largest graph (in terms of the number of vertices) ...
The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and ...
<p>In this paper, we have introduced few Interconnection Networks, called David Derived Network DD(n...
Generalized honeycomb torus is a candidate for interconnection network architectures, which includes...
The honeycomb torus is an alternative to the usual torus networks commonly used in parallel architec...
We obtain the conditional fault-diameter of the square torus interconnection network under the condi...
doi:10.4156/jcit.vol5. issue9.20 Petersen-Gaussian (PG) networks are a broad family of interconnecti...
The study of the diameter of the graph of polyhedra is a classical problem in the theory of linear p...
It has become fashionable to argue against research on new interconnection networks by claiming that...
Abstract. The bisection width of interconnection networks has always been im-portant in parallel com...
AbstractThe determination of the diameter of an interconnection network is essential in evaluating t...
AbstractThe effectiveness of an interconnection network is one of the dominating performance factors...
International audienceWe define the higher dimensional honeycomb graphs as a generalization of hexag...
We dene the higher dimensional honeycomb graphs as a generalization of hexagonal plane tessellation,...
We present an optimal embedding of a honeycomb network (honeycomb mesh and honeycomb torus) of size ...
The degree diameter problem involves finding the largest graph (in terms of the number of vertices) ...
The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and ...
<p>In this paper, we have introduced few Interconnection Networks, called David Derived Network DD(n...
Generalized honeycomb torus is a candidate for interconnection network architectures, which includes...
The honeycomb torus is an alternative to the usual torus networks commonly used in parallel architec...
We obtain the conditional fault-diameter of the square torus interconnection network under the condi...
doi:10.4156/jcit.vol5. issue9.20 Petersen-Gaussian (PG) networks are a broad family of interconnecti...
The study of the diameter of the graph of polyhedra is a classical problem in the theory of linear p...
It has become fashionable to argue against research on new interconnection networks by claiming that...
Abstract. The bisection width of interconnection networks has always been im-portant in parallel com...