Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques (1996)
Oct. 20, 1996 to Oct. 23, 1996
A. Sohn , New Jersey Institute of Technology
J. Ku , New Jersey Institute of Technology
Y. Kodama , Electrotechnical Laboratory
M. Sato , Electrotechnical Laboratory
H. Sakane , Electrotechnical Laboratory
H. Yamana , Electrotechnical Laboratory
S. Sakai , Electrotechnical Laboratory
Y. Yamaguchi , Electrotechnical Laboratory
Overlapping computation with communication is central to obtaining high performance on distributed-memory multiprocessors. This report explicates the overlapping capability of two distributed-memory multiprocessors: the EM-X and IBM SP-2. The well-known bitonic sorting algorithm is selected for experiments. Various message sizes are used to determine when, where, how much and why overlapping takes place. Experimental results indicate that both multiprocessors would yield up to 30% to 40% overlap of communication time when the message size is approximately 1K integers. EM-X is found message-size insensitive yielding high overlap for various message sizes while SP-2 was effective for the window of message size 512 to 2K integers.
H. Sakane et al., "Identifying the Capability of Overlapping Computation with Communication," Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques(PACT), Boston, MA, 1996, pp. 0133.