PSTSWM Paragon Communication Protocol Performance

Performance Studies using

PSTSWM

Intel Paragon Protocol Performance

(transpose LT experiment II-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
Number of Timesteps: 12
Results:

1x16 Processors / Problem T21L2
Runtime Statistics
min(mean-min)/min(median-min)/min(max-min)/min
  3.0825e-01   0.35   0.24   2.49 
Three Fastest
Protocols
1st2nd3rd
  b0   a2   a1 
       Number of Proctocols With
Runtimes Within X% of Min
1%5%25%
  1   5   13 

1x32 Processors / Problem T42L1
Runtime Statistics
min(mean-min)/min(median-min)/min(max-min)/min
  5.7208e-01   0.16   0.12   0.41 
Three Fastest
Protocols
1st2nd3rd
  c2   b0   e3 
       Number of Proctocols With
Runtimes Within X% of Min
1%5%25%
  1   7   23 

1x8 Processors / Problem T42L2
Runtime Statistics
min(mean-min)/min(median-min)/min(max-min)/min
  1.1483e+00   0.13   0.13   0.30 
Three Fastest
Protocols
1st2nd3rd
  b0   a1   a2 
       Number of Proctocols With
Runtimes Within X% of Min
1%5%25%
  5   10   22 

1x16 Processors / Problem T85L1
Runtime Statistics
min(mean-min)/min(median-min)/min(max-min)/min
  1.7419e+00   0.12   0.13   0.23 
Three Fastest
Protocols
1st2nd3rd
  a1   a2   a3 
       Number of Proctocols With
Runtimes Within X% of Min
1%5%25%
  1   3   25 

1x32 Processors / Problem T85L2
Runtime Statistics
min(mean-min)/min(median-min)/min(max-min)/min
  2.0607e+00   0.23   0.19   1.63 
Three Fastest
Protocols
1st2nd3rd
  b0   a2   a3 
       Number of Proctocols With
Runtimes Within X% of Min
1%5%25%
  2   6   15 

1x8 Processors / Problem T85L4
Runtime Statistics
min(mean-min)/min(median-min)/min(max-min)/min
  1.2537e+01   0.23   0.23   0.35 
Three Fastest
Protocols
1st2nd3rd
  a0   b0   b1 
       Number of Proctocols With
Runtimes Within X% of Min
1%5%25%
  1   1   14 

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