Identifying the capability of overlapping computation with communication

A. Sohn*, J. Ku, Y. Kodama, M. Sato, H. Sakane, H. Yamana, S. Sakai, Y. Yamaguchi


研究成果: Conference article査読

9 被引用数 (Scopus)


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.

ジャーナルParallel Architectures and Compilation Techniques - Conference Proceedings, PACT
出版ステータスPublished - 1996 1月 1
イベントProceedings of the 1996 Conference on Parallel Architectures and Compilation Techniques, PACT'96 - Boston, MA, USA
継続期間: 1996 10月 201996 10月 23

ASJC Scopus subject areas

  • ソフトウェア
  • 理論的コンピュータサイエンス
  • ハードウェアとアーキテクチャ


「Identifying the capability of overlapping computation with communication」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。