PSTSWM SP3-200 Algorithm Comparison

Performance Studies using

PSTSWM

IBM SP3-200 Algorithm Comparison

(distributed LT experiment II-B1 )

Date/Person: June 6, 1999 / P. Worley
Platform: IBM SP3 at Oak Ridge National Laboratory (morgan.ccs.ornl.gov):
     62 2-way Winterhawk I SMP nodes (200 MHz POWER3 with 4MB L2 cache, equivalent to RS/6000 Model 260)
Environment: AIX 4.3.2;   PSSP 3.1
Code Version: 6.5
Compilation Options: mpxlf -O3 -qarch=auto -qtune=auto -qcache=auto
Link Options: -bmaxdata:0x70000000
Math Library: ESSL
Communication Library: MPI over the switch using user space for internode communication
MPI using IP for intranode communication
Number of Timesteps: 12
Results:

Distributed LT (2) (mpi) / Row Major Processor Ordering
Algorithm Comparison
  T42L2     T42L2     T42L16    T85L4     T85L4     T85L32 
  P=2x32     P=4x16     P=8x8     P=2x32     P=4x16     P=8x8  
  optimal algorithm   halfsum  halfsum  ringsum  ringsum  ringsum  ringsum 
  (allreduce-min)/min     0.703    0.297    0.039    0.337    0.174    0.054 
  (generic-min)/min     1.255    0.560    0.041    0.210    0.178    0.012 

Patrick H. Worley / ( worleyph@ornl.gov)
Last Modified Monday, 15-Jul-2002 10:15:07 EDT.