Scheduling computation processes including all-to-all communications (a2a) for pipelined parallel processing among plurality of processor nodes constituting network of n-dimensional space

Abstract

Optimally scheduling a plurality of computation processes including all-to-all communications (A2A) among a plurality of nodes (processors) constituting an n-dimensional (a torus or a mesh) network. The plurality of nodes (processors) constituting the network are divided into a communication (computation process) phase (A2A-L) required for all-to-all communications only among a plurality of nodes included in a first subgroup and a communication (computation process) phase (A2A-P) required for all-to-all communications only among a plurality of nodes included in a second subgroup to perform parallel processing with the phases overlapped with each other across a plurality of threads (thread, thread, thread, and thread). It is also possible to perform the parallel processing with respect to a plurality of computation processes such as a fast Fourier transform (FFT) and a transpose (T) (internal transpose).