#!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 # # # # (16) CONTIGUOUS DAXPY: A(I)=S*B(I)+C(I) # # ICASE= 16 NCASE= 17 NMAX=100000 NTIMES= 100000 # # # #NI R(N) #vlen Mflop/s 1 45.487633 2 44.333790 3 43.907272 4 48.118382 5 48.050308 6 47.203548 7 44.146187 8 42.385525 9 41.115849 10 40.152645 20 36.281521 30 34.886204 40 34.872559 50 34.361805 60 34.149796 70 34.203640 80 33.896652 90 33.814034 100 33.943779 200 33.435333 600 33.401657 700 33.224766 800 33.223476 900 33.401901 1000 33.205116 2000 33.061787 3000 33.213272 4000 32.994762 5000 31.863045 6000 29.992802 7000 24.404724 8000 24.201355 9000 23.192226 10000 24.222553 20000 24.469885 30000 24.497423 40000 24.445574 50000 24.549082 60000 24.753128 70000 24.132872 80000 24.339901 90000 24.693581 100000 23.902403 # # # # # 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.