Identifying the capability of overlapping computation with communication

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

Identifying the capability of overlapping computation with communication

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

^*Corresponding author for this work

Research output: Contribution to journal › Conference article › peer-review

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 language	English
Pages (from-to)	133-138
Number of pages	6
Journal	Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT
Publication status	Published - 1996 Jan 1
Externally published	Yes
Event	Proceedings of the 1996 Conference on Parallel Architectures and Compilation Techniques, PACT'96 - Boston, MA, USA Duration: 1996 Oct 20 → 1996 Oct 23

ASJC Scopus subject areas

Software
Theoretical Computer Science
Hardware and Architecture

Cite this

@article{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 H. Yamana and S. Sakai and Y. Yamaguchi",

year = "1996",

month = jan,

day = "1",

language = "English",

pages = "133--138",

journal = "Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT",

issn = "1089-795X",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "Proceedings of the 1996 Conference on Parallel Architectures and Compilation Techniques, PACT'96 ; Conference date: 20-10-1996 Through 23-10-1996",

}

TY - JOUR

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, H.

AU - Sakai, S.

AU - Yamaguchi, Y.

PY - 1996/1/1

Y1 - 1996/1/1

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 article

AN - SCOPUS:0029727823

SN - 1089-795X

SP - 133

EP - 138

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

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

T2 - Proceedings of the 1996 Conference on Parallel Architectures and Compilation Techniques, PACT'96

Y2 - 20 October 1996 through 23 October 1996

ER -

Identifying the capability of overlapping computation with communication

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this