28th Annual IEEE International Conference on Local Computer Networks, 2003. LCN '03. Proceedings.
DOI: 10.1109/lcn.2003.1243181
|View full text |Cite
|
Sign up to set email alerts
|

Pipelining and overlapping for mpi collective operations

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 17 publications
(12 citation statements)
references
References 9 publications
0
12
0
Order By: Relevance
“…[9] describes the combination of DMA and PIO in pipelining algorithms for Broadcast, Reduce, and Allreduce. We used the ideas presented in [10] to tailor our algorithms for torus networks.…”
Section: Related Workmentioning
confidence: 99%
“…[9] describes the combination of DMA and PIO in pipelining algorithms for Broadcast, Reduce, and Allreduce. We used the ideas presented in [10] to tailor our algorithms for torus networks.…”
Section: Related Workmentioning
confidence: 99%
“…Current collective communication algorithms [19,20,21,22,23,24,15,16,17,25,26,27] are designed for the inter-node layer, and are point-to-point, based only. Some algorithms consider the features of SMP architecture [18] ; the approach is also based on point-to-point communications, and no overlapping between inter-node/intra-node communications.…”
Section: Efficient Collective Communications Design Based On the New mentioning
confidence: 99%
“…Different algorithms for collective communications on tlie inter-node layer have been developed during the last two decades [20,21,22,24,23,15,16,17,25,26,27]. Their assumption is that there is no hierarchical structure in communications, and the underlying network is fully connected.…”
Section: Algorithms For the Inter-node Collective Communicationmentioning
confidence: 99%
“…Optimization of collectives is not a new research topic and a wide range of optimized collective algorithms have been proposed in the past [1,3,5]. Communication performance models [4] have been used for collectives by predicting the runtime of various collective algorithms and switching between them accordingly [6].…”
Section: Introduction and Related Workmentioning
confidence: 99%