Message-passing performance of various computers
β Scribed by Dongarra, Jack J.; Dunigan, Tom
- Publisher
- John Wiley and Sons
- Year
- 1997
- Tongue
- English
- Weight
- 167 KB
- Volume
- 9
- Category
- Article
- ISSN
- 1040-3108
No coin nor oath required. For personal study only.
β¦ Synopsis
This report compares the performance of different computer systems for basic message passing. Latency and bandwidth are measured on Convex, Cray, IBM, Intel, KSR, Meiko, nCUBE, NEC, SGI and TMC multiprocessors. Communication performance is contrasted with the computational power of each system. The comparison includes both shared and distributed memory computers as well as networked workstation clusters.
π SIMILAR VOLUMES
Today's massively parallel machines are typically message-passing systems consisting of hundreds or thousands of processors. Implementing parallel applications efficiently in this environment is a challenging task, and poor parallel design decisions can be expensive to correct. Tools and techniques
The "nite di!erence time domain method (FDTD) solves Maxwell's equations by employing numerically and storage intensive computation to map the electric and magnetic "elds within a "nite volume as an explicit function of time. Distributed computation, using heterogeneous networks of computers, is a c
This paper discusses a multithreaded software architecture for messagepassing interface (MPI) software specification. The architecture is thread-safe, allows for concurrent communication over several communications media (multifabric communication), efficiently utilizes available hardware concurrenc