$\"\"$ $\"\"$ $\"\"$
Go backward to Local Communication
Go up to Top
Go forward to Global Communication

Global Communication

Example: parallel reduction operation

$S =$ sum_i=0^N-1X_i

Initial: central manager approach

Time complexity $O(N)$
Centralized algorithm
Computation and communication operations are not distributed.
Sequential algorithm
Computation and communication operations cannot proceed concurrently.

Communication structure must be reorganized.

(See Foster, Figure 2.6)

Author: Wolfgang Schreiner
Last modification: November 15, 1996