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
Load balancing on parallel computers aims at equilibrating some initial load which is initially diff...
The star network is one of the promising interconnection networks for future high speed parallel com...
[[abstract]]In this paper, we propose two one-to-all optimal broadcasting algorithms in incomplete s...
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...
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...
AbstractThis paper is a survey of existing methods of communication in usual networks. We particular...
We discuss optimal communication and decomposition algorithms for a class of regular problems on con...
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 ...
Some generalized communication modes enabling the dissemination of information among processors of i...
AbstractSome generalized communication modes enabling the dissemination of information among process...
The generalized dimension exchange (GDE) method is a fully distributed load balancing method that op...
The star graph has been known as an attractive candidate for interconnecting a large number of proce...
Load balancing on parallel computers aims at equilibrating some initial load which is initially diff...
The star network is one of the promising interconnection networks for future high speed parallel com...
[[abstract]]In this paper, we propose two one-to-all optimal broadcasting algorithms in incomplete s...
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...
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...
AbstractThis paper is a survey of existing methods of communication in usual networks. We particular...
We discuss optimal communication and decomposition algorithms for a class of regular problems on con...
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 ...
Some generalized communication modes enabling the dissemination of information among processors of i...
AbstractSome generalized communication modes enabling the dissemination of information among process...
The generalized dimension exchange (GDE) method is a fully distributed load balancing method that op...
The star graph has been known as an attractive candidate for interconnecting a large number of proce...
Load balancing on parallel computers aims at equilibrating some initial load which is initially diff...
The star network is one of the promising interconnection networks for future high speed parallel com...
[[abstract]]In this paper, we propose two one-to-all optimal broadcasting algorithms in incomplete s...
DOI
Add to ORKG