#!SPARC Station ELC ##Parkbench (LOWLEV_1.0), ##09/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: 09/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: SUN #*model number: SPARC Station ELC #cpu: #cpu speed (MHz): #fpu: integrated #primary cache: #secondary cache: #other cache: #memory: #disk and connection: #interconnect type: #switching: #other hardware: #operating system and version: #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 === # === === # ================================================= # # Run on single SUN SPARC Station ELC # at Old Dominion University, VA, USA (CCPO) # Software levels are # # Contact: Roger Hockney, rwh@pac.soton.ac.uk # # (1) CONTIGUOUS DYADS: A(I)=B(I)*C(I) # # # ICASE= 1 NCASE= 17 NMAX=100000 NTIMES= 100000 # # #NI R(N) #vlen Mflop/s 1 1.057525 2 1.388314 3 1.536770 4 1.595915 5 1.682787 6 1.725822 7 1.737228 8 1.760408 9 1.782357 10 1.810133 20 1.874424 30 1.901225 40 1.910040 50 1.917177 60 1.922028 70 1.903847 80 1.923265 90 1.928771 100 1.926799 200 1.928260 300 1.925331 400 1.914967 500 1.917900 600 1.902853 700 1.915185 800 1.911207 900 1.904054 1000 1.908215 2000 1.702839 6000 1.451714 7000 1.407164 8000 1.290729 9000 1.355625 10000 1.394499 20000 1.338996 30000 1.398859 40000 1.403731 50000 1.396103 60000 1.401607 70000 1.398911 80000 1.399948 90000 1.401289 100000 1.399316 # 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) # <= 90 0.306 1.031 0.609 | Min = 0.277 # >= 700 8.516 0.625 1379.370 | Max = 1.033 # # (2) DYADS, STRIDE=8: A(I)=B(I)*C(I) # <= 50 0.814 1.021 0.348 | Min = 0.382 # >= 300 0.280 0.383 -36.084 | Max = 1.355 # # (3) CONTIGUOUS TRIADS: A(I)=B(I)*C(I)+D(I) # <= 90 0.153 1.738 0.536 | Min = 0.883 # >= 700 3.437 1.003 -1260.831 | Max = 1.732 # # (4) TRIADS, STRIDE=8: A(I)=B(I)*C(I)+D(I) # <= 80 0.196 1.723 0.432 | Min = 0.566 # >= 600 0.340 0.572 -7.368 | Max = 1.720 # # (5) RANDOM SCATTER/GATHER: # <= 100 0.186 1.223 0.453 | Min = 0.792 # >= 800 0.330 0.928 -141.275 | Max = 1.222 # # (6) CONTIGUOUS 4-OP: A(I)=B(I)*C(I)+D(I)*E(I)+F(I) # <= 100 0.293 2.489 0.423 | Min = 1.176 # >= 800 1.607 1.533 544.956 | Max = 2.489 # # (7) INNER PRODUCT: S=S+B(I)*C(I) # <= 400 1.039 3.283 1.412 | Min = 1.958 # >= 2000 0.260 1.964 -353.410 | Max = 8.959 # # (8) FIRST ORDER RECURRENCE: A(I)=B(I)*A(I-1)+D(I) # <= 90 0.668 2.266 0.076 | Min = 1.247 # >= 700 0.317 1.262 -210.728 | Max = 2.353 # # (9) CHARGE ASSIGNMENT: A(J(I))=A(J(I))+S # <= 800 0.255 1.529 0.372 | Min = 0.716 # >= 6000 6.396 1.121 -449.213 | Max = 1.561 # # (10) TRANSPOSITION: B(I,J)=A(J,I) # <= 60 2.014 1.213 0.848 | Min = 0.613 # >= 400 0.000 1.108 -0.288 | Max = 1.279 # # (11) MATRIX MULT BY INNER PRODUCT # <= 60 0.666 2.336 0.586 | Min = 0.871 # >= 400 0.000 2.225 -0.005 | Max = 2.329 # # (12) MATRIX MULT BY MIDDLE PRODUCT # <= 70 0.508 2.240 0.500 | Min = 0.906 # >= 500 0.000 2.135 -0.237 | Max = 2.236 # # (13) MATRIX MULT BY OUTER PRODUCT # <= 9 0.109 0.593 0.663 | Min = 0.355 # >= 10 0.880 0.369 -538.845 | Max = 0.570 # # (14) DYADS, STRIDE=128: A(I)=B(I)*C(I) # <= 40 0.599 1.017 0.699 | Min = 0.376 # >= 200 0.722 0.385 0.463 | Max = 1.008 # # (15) DYADS, STRIDE=1024: A(I)=B(I)*C(I) # <= 6 0.290 0.976 0.530 | Min = 0.340 # >= 40 3.321 0.330 -7.612 | Max = 0.918 # # (16) CONTIGUOUS DAXPY: A(I)=S*B(I)+C(I) # <= 800 0.124 1.914 0.193 | Min = 1.058 # >= 6000 0.285 1.404 244.719 | Max = 1.929 # # (17) INDIRECT DAXPY: A(J(I))=S*B(K(I))+C(L(I)) # <= 80 0.316 1.563 0.571 | Min = 0.512 # >= 600 4.434 0.778 802.178 | Max = 1.562 # # # # TOTAL EXECUTION TIME IS 2.3646922302E+02 SECONDS.