Premium
The performance and scalability of SHMEM and MPI‐2 one‐sided routines on a SGI Origin 2000 and a Cray T3E‐600
Author(s) -
Luecke Glenn R.,
Spanoyannis Silvia,
Kraeva Marina
Publication year - 2004
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.796
Subject(s) - computer science , scalability , parallel computing , binary tree , binary number , tree (set theory) , operating system , programming language , arithmetic , mathematics , mathematical analysis
This paper compares the performance and scalability of SHMEM and MPI‐2 one‐sided routines on different communication patterns for a SGI Origin 2000 and a Cray T3E‐600. The communication tests were chosen to represent commonly used communication patterns with low contention (accessing distant messages, a circular right shift, a binary tree broadcast) to communication patterns with high contention (a ‘naive’ broadcast and an all‐to‐all). For all the tests and for small message sizes, the SHMEM implementation significantly outperformed the MPI‐2 implementation for both the SGI Origin 2000 and Cray T3E‐600. Copyright © 2004 John Wiley & Sons, Ltd.