Theodore B. Tabe
EECS Department, University of Michigan
Quentin F. Stout
EECS Department, University of Michigan
We analyze both the static and dynamic aspects of the MPI procedure calls in these benchmarks, characterizing the routines that are utilized and the message lengths involved. We also provide the communication kernals of these benchmarks, showing that they have loop-based structures that are easily characterized.
Keywords:
parallel computing, benchmarks, trace analysis, message-passing,
distributed memory parallel computer, parallel computing,
communication libraries, MPI, NAS Parallel Benchmarks, performance
evaluation
This paper also available as University of Michigan Computer Science and Engineering technical report CSE-TR-386-99.
| Parallel computing: | overview of my work | papers |
![]() |
Copyright © 2005-2008 Quentin F. Stout |