PSTSWM Paragon Communication Protocol Performance

Performance Studies using

PSTSWM


Intel Paragon Protocol Performance

(distributed FFT experiment A1)

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: distributed FFT
Number of Timesteps: 12
Results:

16x1 Processors / Problem T21L2
Runtime Statistics
min(mean-min)/min(median-min)/min(max-min)/min
  3.4122e-01   0.14   0.10   0.54 
Three Fastest
Protocols
1st2nd3rd
  b0   a2   a3 
       Number of Proctocols With
Runtimes Within X% of Min
1%5%25%
  4   9   20 

32x1 Processors / Problem T42L1
Runtime Statistics
min(mean-min)/min(median-min)/min(max-min)/min
  4.5878e-01   0.11   0.05   0.53 
Three Fastest
Protocols
1st2nd3rd
  b0   a3   a2 
       Number of Proctocols With
Runtimes Within X% of Min
1%5%25%
  4   14   23 

8x1 Processors / Problem T42L2
Runtime Statistics
min(mean-min)/min(median-min)/min(max-min)/min
  1.7509e+00   0.11   0.07   0.54 
Three Fastest
Protocols
1st2nd3rd
  b6   b1   b4 
       Number of Proctocols With
Runtimes Within X% of Min
1%5%25%
  7   10   23 

16x1 Processors / Problem T85L1
Runtime Statistics
min(mean-min)/min(median-min)/min(max-min)/min
  2.5071e+00   0.10   0.05   0.54 
Three Fastest
Protocols
1st2nd3rd
  b0   b6   b1 
       Number of Proctocols With
Runtimes Within X% of Min
1%5%25%
  7   12   23 

32x1 Processors / Problem T85L2
Runtime Statistics
min(mean-min)/min(median-min)/min(max-min)/min
  2.9739e+00   0.13   0.09   0.74 
Three Fastest
Protocols
1st2nd3rd
  b6   b0   b1 
       Number of Proctocols With
Runtimes Within X% of Min
1%5%25%
  7   7   23 

8x1 Processors / Problem T85L4
Runtime Statistics
min(mean-min)/min(median-min)/min(max-min)/min
  1.8093e+01   0.07   0.04   0.41 
Three Fastest
Protocols
1st2nd3rd
  b6   b4   b5 
       Number of Proctocols With
Runtimes Within X% of Min
1%5%25%
  7   15   23 

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:26 EDT.