Identifying the capability of overlapping computation with communication

Author

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

Author_Institution

Dept. of Comput. & Inf. Sci., New Jersey Inst. of Technol., Newark, NJ, USA

fYear

1996

fDate

35339

Firstpage

133

Lastpage

138

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 to be 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

Keywords

IBM computers; distributed memory systems; message passing; parallel algorithms; performance evaluation; sorting; EM-X; IBM SP-2; bitonic sorting algorithm; communication time; computation communication overlap; distributed-memory multiprocessors; experimental results; high performance; message passing; message size; message sizes; Computer architecture; Delay; Distributed computing; High performance computing; Laboratories; Prototypes; Sorting; Switches; Windows; Yarn;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Architectures and Compilation Techniques, 1996., Proceedings of the 1996 Conference on

Conference_Location

Boston, MA

ISSN

1089-795X

Print_ISBN

0-8186-7633-7

Type

conf

DOI

10.1109/PACT.1996.552657

Filename

552657