Home // INFOCOMP 2015, The Fifth International Conference on Advanced Communications and Computation // View article

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

Authors:
Vanessa End
Ramin Yahyapour
Christian Simmendinger
Thomas Alrutz

Keywords: GASPI; Allreduce; Partitioned Global Address Space (PGAS); Collective Communication.

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 butterfly- like 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.

Pages: 13 to 19

Copyright: Copyright (c) IARIA, 2015

Publication date: June 21, 2015

Published in: conference

ISSN: 2308-3484

ISBN: 978-1-61208-416-9

Location: Brussels, Belgium

Dates: from June 21, 2015 to June 26, 2015