Optimized all‐to‐all communication on multicore architectures applied to FFTs with pencil decomposition. (27th September 2018)

• Record Type: Journal Article
• Authors: Jocksch, Andreas; Kraushaar, Matthias; Daverio, David
• Other Names: Thota Abhinav guestEditor.; He Yun guestEditor.; Hart David guestEditor.; Dahan Maytal guestEditor.; Navratil Paul guestEditor.
• Is Part Of: Concurrency and computation. Volume 31:Number 16(2019)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2018-09-27
• Subjects: all‐to‐all communication -- FFTs -- MPI -- multicore; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.4964
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: All‐to‐all communication is a basic functionality of parallel communication libraries such as the Message Passing Interface (MPI). Typically, there are multiple different underlying algorithms, which are chosen according to message size. We propose a communication algorithm, which exploits the fact that modern supercomputers combine shared memory parallelism and distributed memory parallelism. The application example of our algorithm is FFTs with pencil decomposition. Furthermore, we propose an extension of the MPI standard in order to accommodate this and other algorithms in an efficient way.