PSTSWM Paragon Communication Protocol Performance

Performance Studies using

PSTSWM

Intel Paragon Protocol Performance

(transpose FFT experiment A1 / O(P) swap transpose 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: swtrans
Partition: 1x8, 1x16, or 1x32
Results:

16x1 Processors / Problem T10L16
Runtime Statistics
min(mean-min)/min(median-min)/min(max-min)/min
  5.2016e-01   0.35   0.20   1.06 
Three Fastest
Protocols
1st2nd3rd
  b0   a2   a3 
       Number of Proctocols With
Runtimes Within X% of Min
1%5%25%
  3   6   14 

32x1 Processors / Problem T10L16
Runtime Statistics
min(mean-min)/min(median-min)/min(max-min)/min
  8.3222e-01   0.38   0.36   0.91 
Three Fastest
Protocols
1st2nd3rd
  b0   a2   a3 
       Number of Proctocols With
Runtimes Within X% of Min
1%5%25%
  2   8   14 

8x1 Processors / Problem T21L8
Runtime Statistics
min(mean-min)/min(median-min)/min(max-min)/min
  1.1466e+00   0.12   0.14   0.28 
Three Fastest
Protocols
1st2nd3rd
  b0   b1   b3 
       Number of Proctocols With
Runtimes Within X% of Min
1%5%25%
  4   10   23 

16x1 Processors / Problem T21L16
Runtime Statistics
min(mean-min)/min(median-min)/min(max-min)/min
  1.3356e+00   0.23   0.28   0.52 
Three Fastest
Protocols
1st2nd3rd
  b0   a2   b1 
       Number of Proctocols With
Runtimes Within X% of Min
1%5%25%
  1   8   11 

32x1 Processors / Problem T21L32
Runtime Statistics
min(mean-min)/min(median-min)/min(max-min)/min
  1.7638e+00   0.74   0.73   1.75 
Three Fastest
Protocols
1st2nd3rd
  b0   b3   b2 
       Number of Proctocols With
Runtimes Within X% of Min
1%5%25%
  4   8   10 

8x1 Processors / Problem T42L16
Runtime Statistics
min(mean-min)/min(median-min)/min(max-min)/min
  1.0554e+01   0.05   0.03   0.24 
Three Fastest
Protocols
1st2nd3rd
  b1   b0   b2 
       Number of Proctocols With
Runtimes Within X% of Min
1%5%25%
  2   14   25 

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:30:18 EDT.