#!RS6000-590 Workstation ##Parkbench (LOWLEV_1.0), ##07/SEP/1994, ##at Old Dominion University, Norfolk, Virginia, USA #*name: Roger Hockney #*establishment: University of Southampton #*email: rwh@pac.soton.ac.uk #telephone: 0635 578679 #date sent: 01/11/94 #*date benchmarked: 07/SEP/1994 #*benchmark suite and revision: Parkbench (LOWLEV_1.0) #*message passing library and revision: N/A #*benchmark: RINF1 #*problem size (if applicable): N/A #*number of nodes: 1 #*file number if one of a group: 1 of 1 #*manufacturer: IBM #*model number: RS6000-590 Workstation #cpu: Power-2 #cpu speed (MHz): 66MHz #fpu: integrated #primary cache: #secondary cache: #other cache: #memory: #disk and connection: #interconnect type: #switching: #other hardware: #operating system and version: AIX 3.2.5 #compilers, libraries and versions: f77 #compiler switches: -O2 #additional tuning parameters: none #other software: #additional comments: Benchmarks performed on a workstation # at Old Dominion University, Norfolk, Virginia, USA # in the Center for Coastal Physical Oceanography (CCPO). # There were no other users during the measurements. # ================================================= # === === # === PARKBENCH Parallel Benchmarks === # === === # === RINF1 === # === === # === Program: R-infinity and N-half === # === Version: Standard Fortran 77 === # === Author: Roger Hockney === # === Update: November 1993; Release: 1.0 === # === === # ================================================= # This run started Wed Sep 7 09:39:04 1994 # # Run on single IBM RS/6000 Model 590 # at Old Dominion University, VA, USA (CCPO) # Software levels are AIX 3.2.5 # # Contact: Roger Hockney, rwh@pac.soton.ac.uk # # # (8) FIRST ORDER RECURRENCE: A(I)=B(I)*A(I-1)+D(I) # # ICASE= 8 NCASE= 17 NMAX=100000 NTIMES= 100000 # # # # #NI TI #vlen sec 1 7.486725E-09 2 3.844608E-08 3 4.477869E-08 4 6.812160E-08 5 9.701120E-08 6 1.209264E-07 7 1.308494E-07 8 1.662259E-07 9 1.888723E-07 10 2.173056E-07 20 5.137408E-07 30 8.221110E-07 40 1.123635E-06 50 1.416640E-06 60 1.726694E-06 70 2.028280E-06 80 2.316288E-06 90 2.631892E-06 100 2.932992E-06 200 5.916160E-06 600 1.803875E-05 700 2.091358E-05 800 2.392474E-05 900 2.710717E-05 1000 2.990976E-05 2000 6.049024E-05 3000 9.237334E-05 4000 1.203149E-04 5000 1.558016E-04 6000 2.195760E-04 7000 2.692754E-04 8000 3.311147E-04 9000 3.726778E-04 10000 4.310912E-04 20000 8.305920E-04 30000 1.234389E-03 40000 1.656704E-03 50000 2.042304E-03 60000 2.466176E-03 70000 2.844160E-03 80000 3.405184E-03 90000 3.799424E-03 100000 4.120448E-03 # SUMMARY OF SELECTED VALUES # -------------------------- # # LENGTHS RMSERR/VALUE R-INFINITY N-HALF R(N) # vlen % Mflop/s vlen Mflop/s # # (1) CONTIGUOUS DYADS: A(I)=B(I)*C(I) # <= 80 .560 16.740 -1.302 | Min = 11.926 # >= 600 .407 12.201 -368.505 | Max = 24.630 # # (2) DYADS, STRIDE=8: A(I)=B(I)*C(I) # <= 8 2.670 20.538 -.488 | Min = 1.613 # >= 60 1.479 1.577 -190.004 | Max = 24.059 # # (3) CONTIGUOUS TRIADS: A(I)=B(I)*C(I)+D(I) # <= 800 .193 66.835 2.767 | Min = 20.078 # >= 6000 .334 20.716 47.415 | Max = 67.123 # # (4) TRIADS, STRIDE=8: A(I)=B(I)*C(I)+D(I) # <= 200 .328 65.435 2.057 | Min = 2.590 # >= 900 .263 2.597 -25.630 | Max = 64.974 # # (5) RANDOM SCATTER/GATHER: # <= 900 .063 18.958 .779 | Min = 9.489 # >= 7000 .668 12.418 -1354.931 | Max = 18.964 # # (6) CONTIGUOUS 4-OP: A(I)=B(I)*C(I)+D(I)*E(I)+F(I) # <= 80 .350 44.585 -.624 | Min = 23.258 # >= 600 .319 23.313 -452.546 | Max = 55.700 # # (7) INNER PRODUCT: S=S+B(I)*C(I) # <= 700 .253 66.474 .529 | Min = 34.962 # >= 5000 .986 34.204 -2090.563 | Max = 67.506 # # (8) FIRST ORDER RECURRENCE: A(I)=B(I)*A(I-1)+D(I) # <= 80 .746 33.781 -1.911 | Min = 23.197 # >= 600 .734 23.911 -454.478 | Max = 133.570 # # (9) CHARGE ASSIGNMENT: A(J(I))=A(J(I))+S # <= 80 .202 11.392 -.640 | Min = 10.796 # >= 600 .296 10.815 -278.668 | Max = 24.193 # # (10) TRANSPOSITION: B(I,J)=A(J,I) # <= 60 .230 32.877 .912 | Min = 16.660 # >= 400 .000 26.938 -1.743 | Max = 32.430 # # (11) MATRIX MULT BY INNER PRODUCT # <= 80 .585 65.653 2.301 | Min = 13.276 # >= 600 .000 51.412 -4.345 | Max = 64.166 # # (12) MATRIX MULT BY MIDDLE PRODUCT # <= 80 .481 66.191 1.944 | Min = 12.105 # >= 600 .000 52.649 -4.183 | Max = 64.473 # # (13) MATRIX MULT BY OUTER PRODUCT # <= 1600 .157 31.859 7.024 | Min = 7.370 # >= 200 .000 12.834 179.173 | Max = 32.181 # # (14) DYADS, STRIDE=128: A(I)=B(I)*C(I) # <= 0 .000 .000 .000 | Min = .873 # >= 6 4.035 .828 -35.583 | Max = 23.339 # # (15) DYADS, STRIDE=1024: A(I)=B(I)*C(I) # <= 4 2.496 24.984 .223 | Min = .885 # >= 20 .033 .885 -.009 | Max = 24.311 # # (16) CONTIGUOUS DAXPY: A(I)=S*B(I)+C(I) # <= 80 .548 33.508 -1.271 | Min = 23.192 # >= 600 .621 24.181 -428.602 | Max = 48.118 # # (17) INDIRECT DAXPY: A(J(I))=S*B(K(I))+C(L(I)) # <= 600 .077 26.552 .436 | Min = 5.406 # >= 4000 .086 5.427 -7.197 | Max = 26.572 # # # # TOTAL EXECUTION TIME IS 1.6083316803E+01 SECONDS.