Optimal all-ports collective communication algorithms for the k-ary n-cube interconnection networks

2004 ◽  
Vol 50 (4) ◽  
pp. 221-231 ◽  
Author(s):  
Abderezak Touzene
Keyword(s):  
Interconnection Networks ◽  
Collective Communication ◽  
Communication Algorithms

scholarly journals On Directed Edge-Disjoint Spanning Trees in Product Networks, An Algorithmic Approach

2014 ◽  
Vol 11 (2) ◽  
pp. 79
Author(s):  
A.R. Touzene ◽  
K. Day
Keyword(s):  
Interconnection Networks ◽  
Spanning Trees ◽  
Construction Method ◽  
Collective Communication ◽  
Factor Graphs ◽  
Directed Edge ◽  
Algorithmic Approach ◽  
Edge Disjoint ◽  
Communication Algorithms ◽  
Store And Forward

In (Ku et al. 2003), the authors have proposed a construction of edge-disjoint spanning trees EDSTs in undirected product networks. Their construction method focuses more on showing the existence of a maximum number (n1+n2-1) of EDSTs in product network of two graphs, where factor graphs have respectively n1 and n2 EDSTs. In this paper, we propose a new systematic and algorithmic approach to construct (n1+n2) directed routed EDST in the product networks. The direction of an edge is added to support bidirectional links in interconnection networks. Our EDSTs can be used straightforward to develop efficient collective communication algorithms for both models store-and-forward and wormhole. 

BROADCASTING IN BUS INTERCONNECTION NETWORKS

2000 ◽  
Vol 01 (02) ◽  
pp. 73-94
Author(s):  
A. FERREIRA ◽  
A. GOLDMAN ◽  
S. W. SONG
Keyword(s):  
Interconnection Networks ◽  
High Performance ◽  
Interconnection Network ◽  
Parallel Architectures ◽  
Interprocessor Communication ◽  
Efficient Manner ◽  
Graph Theoretic ◽  
Communication Algorithms ◽  
Communication Links ◽  
Point To Point

In most distributed memory MIMD multiprocessors, processors are connected by a point-to-point interconnection network, usually modeled by a graph where processors are nodes and communication links are edges. Since interprocessor communication frequently constitutes serious bottlenecks, several architectures were proposed that enhance point-to-point topologies with the help of multiple bus systems so as to improve the communication efficiency. In this paper we study parallel architectures where the communication means are constituted solely by buses. These architectures can use the power of bus technologies, providing a way to interconnect much more processors in a simple and efficient manner. We present the hyperpath, hypergrid, hyperring, and hypertorus architectures, which are the bus-based versions of the well used point-to-point interconnection networks. Using (hyper) graph theoretic concepts to model inter-processor communication in such networks, we give optimal algorithms for broadcasting a message from one processor to all the others. For deriving high performance communication patterns we developed a new tool called simplification. The idea is to construct a graph, to be called representative graph, from the original hyper-topology, in such a way that it will become easy to describe and perform communication schemes to the former that will fit to the latter, because the simplification concept also allows us to partially use some already known communication algorithms for usual networks.

Communication algorithms in k-ary n-cube interconnection networks

1997 ◽  
Vol 61 (1) ◽  
pp. 43-48 ◽  
Author(s):  
Yaagoub Ashir ◽  
Iain A. Stewart ◽  
Aqeel Ahmed
Keyword(s):  
Interconnection Networks ◽  
Communication Algorithms

Towards scalable collective communication for multicomputer interconnection networks

2004 ◽  
Vol 163 (4) ◽  
pp. 293-306 ◽  
Author(s):  
A.Y. Al-Dubai ◽  
M. Ould-Khaoua ◽  
K. El-Zayyat ◽  
I. Ababneh ◽  
S. Al-Dobai
Keyword(s):  
Interconnection Networks ◽  
Collective Communication
Sign in / Sign up

Export Citation Format

Share Document