Complexity Of Scattering On A Ring Of Processors

Abstract

In this paper, we prove that the complexity of scattering in an oriented ring of p processors is (p-1) * (p + L * z) where L is the length of the messages, p the communication startup, and z the elemental propagation time. 1. SCATTERING In a recent paper, Saad and Schultz [SSI study various basic communication kernels in parallel architectures. They point out that interprocessor communication is often one of the main obstacles to increasing performance of parallel algorithms for multiprocessors. They consider the following data exchange operations: (1) One-to-one: moving data from one processor to another.