Adaption of the n-way Dissemination Algorithm for GASPI Split-Phase Allreduce

2015 | conference paper. A publication of Göttingen

Jump to: Cite & Linked | Documents & Media | Details | Version history

Cite this publication

​Adaption of the n-way Dissemination Algorithm for GASPI Split-Phase Allreduce​
End, V. ; Yahyapour, R. ; Simmendinger, C. & Alrutz, T. ​ (2015)
​The Fifth International Conference on Advanced Communications and Computation (INFOCOMP 2015) pp. 13​-19. ​INFOCOMP 2015​, Brussels, Belgium.
Red Hook, USA​: Curran.

Documents & Media

License

GRO License GRO License

Details

Authors
End, Vanessa ; Yahyapour, Ramin ; Simmendinger, Christian; Alrutz, Thomas 
Abstract
This paper presents an adaption of the n-way dissemination algorithm, such that it can be used for an allreduce operation, which is - together with the barrier operation - one of the most time consuming collective communication routines available in most parallel communication interfaces and libraries. Thus, a fast underlying algorithm with few communication rounds is needed. The dissemination algorithm is such an algorithm and already used for a variety of barrier implementations due to its speed. Yet, this algorithm is also interesting for the split-phase allreduce operations, as defined in the Global Address Space Programming Interface (GASPI) specification, due to its small number of communication rounds. Even though it is a butterflylike algorithm, significant improvements in runtime are seen when comparing this implementation on top of ibverbs to different message-passing interface (MPI) implementations, which are the de facto standard for distributed memory computing.
Issue Date
2015
Publisher
Curran
Organization
Gesellschaft für wissenschaftliche Datenverarbeitung 
Conference
INFOCOMP 2015
Conference Place
Brussels, Belgium
Event start
2015-06-21
Event end
2015-06-26
Language
English

Reference

Citations