PSTSWM Paragon Communication Protocol Performance

Performance Studies using

PSTSWM

Intel Paragon Protocol Performance

(distributed LT experiment A1 / exchange sum algorithm)

Date/Person: May 13, 1998 / P. Worley
Platform: Intel Paragon XP/S 150 MP at Oak Ridge National Laboratory:
     1024 MP nodes (3 50-MHz iPSC/860 processors per node)
Environment: Paragon OSF/1 Release 1.0.4 Server 1.4 R1_4_5
f77/Paragon Paragon Version R5.0.3
Code Version: 6.3
Compilation Options: if77 -O4 -Mnodepchk -Knoieee -Msafealloc
Math Library: KAI
Communication Library: MPI
Parallel Algorithm: exchsum
Partition: 1x8, 1x16, or 1x32
Results:

1x16 Processors / Problem T21L2
Runtime Statistics
min(mean-min)/min(median-min)/min(max-min)/min
  2.4334e-01   0.09   0.05   0.80 
Three Fastest
Protocols
1st2nd3rd
  d2   d3   d6 
       Number of Proctocols With
Runtimes Within X% of Min
1%5%25%
  2   11   24 

1x32 Processors / Problem T42L1
Runtime Statistics
min(mean-min)/min(median-min)/min(max-min)/min
  4.7009e-01   0.12   0.05   1.13 
Three Fastest
Protocols
1st2nd3rd
  d3   d2   d4 
       Number of Proctocols With
Runtimes Within X% of Min
1%5%25%
  3   13   24 

1x8 Processors / Problem T42L2
Runtime Statistics
min(mean-min)/min(median-min)/min(max-min)/min
  1.3127e+00   0.04   0.02   0.36 
Three Fastest
Protocols
1st2nd3rd
  d4   d6   d2 
       Number of Proctocols With
Runtimes Within X% of Min
1%5%25%
  7   20   24 

1x16 Processors / Problem T85L1
Runtime Statistics
min(mean-min)/min(median-min)/min(max-min)/min
  2.4636e+00   0.05   0.02   0.54 
Three Fastest
Protocols
1st2nd3rd
  b6   d5   b1 
       Number of Proctocols With
Runtimes Within X% of Min
1%5%25%
  9   19   24 

1x32 Processors / Problem T85L2
Runtime Statistics
min(mean-min)/min(median-min)/min(max-min)/min
  4.0042e+00   0.10   0.04   1.03 
Three Fastest
Protocols
1st2nd3rd
  b0   b6   b1 
       Number of Proctocols With
Runtimes Within X% of Min
1%5%25%
  3   13   24 

1x8 Processors / Problem T85L4
Runtime Statistics
min(mean-min)/min(median-min)/min(max-min)/min
  1.4442e+01   0.03   0.02   0.29 
Three Fastest
Protocols
1st2nd3rd
  b6   b5   b4 
       Number of Proctocols With
Runtimes Within X% of Min
1%5%25%
  6   23   24 

DISCUSSION

Partitions of the Paragon processor grid were used that match the processor subsets that the parallel algorithms would run on in a two dimensional data decomposition: 1x8, 1x16, and 1x32.
Patrick H. Worley / ( worleyph@ornl.gov)
Last Modified Monday, 15-Jul-2002 10:29:33 EDT.