Identifying the Capability of Overlapping Computation with Communication (1996)
| Citations: | 7 - 1 self |
BibTeX
@MISC{Sohn96identifyingthe,
author = {A. Sohn and J. Ku and Y. Kodama and M. Sato and S. Sakai and H. Yamana and S. Sakai and Y. Yamaguchi},
title = {Identifying the Capability of Overlapping Computation with Communication},
year = {1996}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Overlapping computation with communication is central to obtaining high performance on distributed-memory multiprocessors. Identifying the capability of overlapping, machine architects and programmers will be able to provide tools which can effectively utilize the underlying architecture. This report explicates the overlapping capability of two distributed-memory multiprocessors: the laboratory prototype EM-X multithreaded multiprocessor and a commercially available IBM SP2 with wide nodes. 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 SP2 was effective for a window of message size of 512 to 2K integers, depen...
