Fast Collective Communication Algorithms for Reflective Memory Network Clusters

2000 ◽  
pp. 100-114 ◽  
Author(s):  
Vijay Moorthy ◽  
Dhabaleswar K. Panda ◽  
P. Sadayappan
Keyword(s):  
Collective Communication ◽  
Communication Algorithms ◽  
Memory Network

Modeling advanced collective communication algorithms on cell-based systems

2010 ◽  
Vol 45 (5) ◽  
pp. 293-304
Author(s):  
Qasim Ali ◽  
Samuel Pratt Midkiff ◽  
Vijay S. Pai
Keyword(s):  
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. 

Sign in / Sign up

Export Citation Format

Share Document