Fortran Benchmark Tests machine = noyau, Celeron 2.4GHz,linux compile with [ g77 -malign-double -O3 -funroll-loops -fexpensive-optimizations ] date = Fri Jul 6 11:05:13 JST 2007 ------------------------------------------------------------------------------ (1) program = intgl4.f #PTS= 200**4 A= 0.1000 S= 3.244281965 29.413u 0.007s 0:29.66 99.1% 0+0k 0+0io 135pf+0w ------------------------------------------------------------------------------ (2) program = intosc.f I( 1000000000)= -2267 I( 1000000001)= -1233 28.467u 0.009s 0:28.65 99.3% 0+0k 0+0io 120pf+0w ------------------------------------------------------------------------------ (3) program = intpi3.f PI= 50893811591411064*120/(8*N**5+15*N**3), N= 3000 17.606u 0.003s 0:17.71 99.3% 0+0k 0+0io 120pf+0w ------------------------------------------------------------------------------ (4) program = jacobi11.f DIMENSION= 11 #JACOBI ROT CYC= 5* 200000 EMIN= -0.663815 EMAX= 10.309197 22.550u 0.004s 0:22.69 99.3% 0+0k 0+0io 138pf+0w ------------------------------------------------------------------------------ (5) program = jacobi1h.f DIMENSION=101 #JACOBI ROT CYC= 5* 200 EMIN= -3.859769 EMAX= 104.276991 16.372u 0.003s 0:16.43 99.6% 0+0k 0+0io 138pf+0w ------------------------------------------------------------------------------ (6) program = leqs1k.f DIM= 1001 #INV= 5 RESULTS: 0.9983222082 0.9999235137 1.0001292085 431.586u 0.092s 7:14.61 99.3% 0+0k 0+0io 135pf+0w ------------------------------------------------------------------------------ (7) program = leqs4h.f DIM= 401 #INV= 78 RESULTS: 0.9989295956 0.9989933805 0.9982736386 177.437u 0.023s 2:58.65 99.3% 0+0k 0+0io 135pf+0w ------------------------------------------------------------------------------ (8) program = mathfnc1.f INTEGRAL[ 0.1 0.9: 100000000 STEPS](SIN(X)+SQRT(COS(X)))DX= 1.111225554 18.606u 0.002s 0:18.72 99.3% 0+0k 0+0io 137pf+0w ------------------------------------------------------------------------------ (9) program = mathfnc2.f INTEGRAL[ 0.1 0.9: 100000000 STEPS]ATAN2(EXP(X),LOG(X+1))DX= 1.081785145 39.875u 0.003s 0:40.17 99.2% 0+0k 0+0io 142pf+0w ------------------------------------------------------------------------------ (10) program = matvec.f MULTIPLY 1023*1023 REAL MATRIX TO VECTOR 3* 2000 TIMES. LARGEST EIGENVALUES= 1023.93053 1022.12165 1021.00563 30.454u 0.030s 0:30.67 99.3% 0+0k 0+0io 136pf+0w ------------------------------------------------------------------------------ (11) program = matvecz.f MULTIPLY 723* 723 COMPLEX MATRIX TO VECTOR 3* 1000 TIMES LARGEST EIGENVALUES= 723.98791 722.12717 720.97077 15.966u 0.021s 0:16.07 99.4% 0+0k 0+0io 137pf+0w ------------------------------------------------------------------------------ (12) program = permute1.f INT*4 ARRAY_SIZE= 1024 #PERMUTATIONS/ARRAY_SIZE= 262144 A= 149 293 506 728 569 228 413 551 883 676 2.729u 0.000s 0:02.74 99.2% 0+0k 0+0io 120pf+0w ------------------------------------------------------------------------------ (13) program = permute2.f INT*4 ARRAY_SIZE= 32768 #PERMUTATIONS/ARRAY_SIZE= 8192 A= 149 293 16365 22125 2429 5407 28746 12182 14590 11825 25.266u 0.003s 0:25.43 99.3% 0+0k 0+0io 120pf+0w ------------------------------------------------------------------------------ (14) program = permute3.f INT*4 ARRAY_SIZE= 1048576 #PERMUTATIONS/ARRAY_SIZE= 256 A= 149 293 524435 178798 836951 263828 662616 351174 26552 147396 107.708u 0.034s 1:48.49 99.2% 0+0k 0+0io 120pf+0w ------------------------------------------------------------------------------ (15) program = runge.f 4TH-ORDER RUNGE-KUTTA FOR POTENTIAL=LOG(R). INITIAL R= 1.0 0.0 V= 0.0 1.5 TIME= 200000000* 0.00050 R= 1.95711 -1.69674 V= 0.29953 0.50675 25.249u 0.006s 0:25.40 99.3% 0+0k 0+0io 139pf+0w ------------------------------------------------------------------------------ completed at Fri Jul 6 11:21:54 JST 2007