AbstractStar graphs, as discussed in [1], are considered to be attractive alternatives for hypercubes. In this paper, we discuss optimal data exchange algorithms for star graphs of small dimension (n ≤ 6). In particular we study odd-distance and total exchange algorithms, using the tabular method introduced in [2]. The algorithms use no intermediate buffering of messages
AbstractSome generalized communication modes enabling the dissemination of information among process...
Some generalized communication modes enabling the dissemination of information among processors of i...
International audienceGossiping (also called total exchange or all-to-all communication) is the proc...
AbstractStar graphs, as discussed in [1], are considered to be attractive alternatives for hypercube...
A tabular method for verication of data exchange algorithms on networks which possess a certain symm...
The hyper-star interconnection network was proposed in 2002 to overcome the drawbacks of the hyperc...
We propose a new class of interconnection networks, called macro-star networks, which belong to the ...
AbstractOur purpose in the present paper is to investigate different topological properties of the r...
AbstractThis paper is a survey of existing methods of communication in usual networks. We particular...
The (n, k)-star interconnection network was proposed in 1995 as an attractive alternative to the n-...
AbstractIn this paper we give new results on the fault-tolerance capabilities of the star graph. We ...
AbstractThe star graph has drawn a lot of attention recently as an attractive alternative to hypercu...
AbstractA ‘sandwich graph’ is obtained by connecting the corresponding vertices of two copies of a g...
We discuss the problem of packing hypercubes into an n-dimensional star graph S(n), which consists o...
AbstractThe purpose of the work is to provide a solution to the long-standing problem of computing t...
AbstractSome generalized communication modes enabling the dissemination of information among process...
Some generalized communication modes enabling the dissemination of information among processors of i...
International audienceGossiping (also called total exchange or all-to-all communication) is the proc...
AbstractStar graphs, as discussed in [1], are considered to be attractive alternatives for hypercube...
A tabular method for verication of data exchange algorithms on networks which possess a certain symm...
The hyper-star interconnection network was proposed in 2002 to overcome the drawbacks of the hyperc...
We propose a new class of interconnection networks, called macro-star networks, which belong to the ...
AbstractOur purpose in the present paper is to investigate different topological properties of the r...
AbstractThis paper is a survey of existing methods of communication in usual networks. We particular...
The (n, k)-star interconnection network was proposed in 1995 as an attractive alternative to the n-...
AbstractIn this paper we give new results on the fault-tolerance capabilities of the star graph. We ...
AbstractThe star graph has drawn a lot of attention recently as an attractive alternative to hypercu...
AbstractA ‘sandwich graph’ is obtained by connecting the corresponding vertices of two copies of a g...
We discuss the problem of packing hypercubes into an n-dimensional star graph S(n), which consists o...
AbstractThe purpose of the work is to provide a solution to the long-standing problem of computing t...
AbstractSome generalized communication modes enabling the dissemination of information among process...
Some generalized communication modes enabling the dissemination of information among processors of i...
International audienceGossiping (also called total exchange or all-to-all communication) is the proc...
DOI
Add to ORKG