Identifying the capability of overlapping computation with communication

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationParallel Architectures and Compilation Techniques - Conference Proceedings, PACT
Pages133-138
Number of pages6
Publication statusPublished - 1996
Externally publishedYes
EventProceedings of the 1996 Conference on Parallel Architectures and Compilation Techniques, PACT'96 - Boston, MA, USA
Duration: 1996 Oct 201996 Oct 23

Other

OtherProceedings of the 1996 Conference on Parallel Architectures and Compilation Techniques, PACT'96
CityBoston, MA, USA
Period96/10/2096/10/23

Fingerprint

Data storage equipment
Communication
Sorting
Experiments

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Sohn, A., Ku, J., Kodama, Y., Sato, M., Sakane, H., Yamana, H., ... Yamaguchi, Y. (1996). Identifying the capability of overlapping computation with communication. In Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT (pp. 133-138)

Identifying the capability of overlapping computation with communication. / Sohn, A.; Ku, J.; Kodama, Y.; Sato, M.; Sakane, H.; Yamana, Hayato; Sakai, S.; Yamaguchi, Y.

Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT. 1996. p. 133-138.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sohn, A, Ku, J, Kodama, Y, Sato, M, Sakane, H, Yamana, H, Sakai, S & Yamaguchi, Y 1996, Identifying the capability of overlapping computation with communication. in Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT. pp. 133-138, Proceedings of the 1996 Conference on Parallel Architectures and Compilation Techniques, PACT'96, Boston, MA, USA, 96/10/20.
Sohn A, Ku J, Kodama Y, Sato M, Sakane H, Yamana H et al. Identifying the capability of overlapping computation with communication. In Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT. 1996. p. 133-138
Sohn, A. ; Ku, J. ; Kodama, Y. ; Sato, M. ; Sakane, H. ; Yamana, Hayato ; Sakai, S. ; Yamaguchi, Y. / Identifying the capability of overlapping computation with communication. Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT. 1996. pp. 133-138
@inproceedings{9b5e1934f8534010a9d956a7f673dcd3,
title = "Identifying the capability of overlapping computation with communication",
abstract = "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.",
author = "A. Sohn and J. Ku and Y. Kodama and M. Sato and H. Sakane and Hayato Yamana and S. Sakai and Y. Yamaguchi",
year = "1996",
language = "English",
pages = "133--138",
booktitle = "Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT",

}

TY - GEN

T1 - Identifying the capability of overlapping computation with communication

AU - Sohn, A.

AU - Ku, J.

AU - Kodama, Y.

AU - Sato, M.

AU - Sakane, H.

AU - Yamana, Hayato

AU - Sakai, S.

AU - Yamaguchi, Y.

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029727823&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029727823&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0029727823

SP - 133

EP - 138

BT - Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT

ER -