Final HPL 9-node benchmark

In this final test (which was not fully completed due to memory shortage) we tested :

• Block size (60, 120)
• Pfacts (0,1,2)
• NBMINs (4,8)
• NDIVs (2,3)
• RFACTs (0,1,2)
• Broadcasts (0,1,2,3,4,5)
• Lookahead (0,1)

HPLinpack benchmark input file
Innovative Computing Laboratory, University of Tennessee
HPL.out         output file name (if any)
8               device out (6=stdout,7=stderr,file)
1               # of problems sizes (N)
15500           Ns
2               # of NBs
60 120          NBs
0               PMAP process mapping (0=Row-,1=Column-major)
1               # of process grids (P x Q)
3               Ps
3               Qs
16.0            threshold
3               # of panel fact
0 1 2           PFACTs (0=left, 1=Crout, 2=Right)
2               # of recursive stopping criterium
4 8             NBMINs (>= 1)
2               # of panels in recursion
2 3             NDIVs
3               # of recursive panel fact.
0 1 2           RFACTs (0=left, 1=Crout, 2=Right)
6               # of broadcast
0 1 2 3 4 5     BCASTs (0=1rg,1=1rM,2=2rg,3=2rM,4=Lng,5=LnM)
2               # of lookahead depth
0 1             DEPTHs (>=0)
2               SWAP (0=bin-exch,1=long,2=mix)
120             swapping threshold
0               L1 in (0=transposed,1=no-transposed) form
0               U  in (0=transposed,1=no-transposed) form
1               Equilibration (0=no,1=yes)
8               memory alignment in double (> 0)