Fortran Benchmark Tests machine = Celeron D345, 3.06GHz, windows XP, cygwin compile with [ g77 -malign-double -O3 -funroll-loops -fexpensive-optimizations ] date = Sat Feb 10 22:33:16 2007 ------------------------------------------------------------------------------ (1) program = intgl4.f #PTS= 200**4 A= 0.1000 S= 3.244281965 24.452u 0.031s 0:24.44 100.1% 0+0k 0+0io 1046pf+0w ------------------------------------------------------------------------------ (2) program = intosc.f I( 1000000000)= -2267 I( 1000000001)= -1233 7.030u 0.046s 0:07.04 100.4% 0+0k 0+0io 1036pf+0w ------------------------------------------------------------------------------ (3) program = intpi3.f PI= 50893811591411064*120/(8*N**5+15*N**3), N= 3000 8.061u 0.030s 0:08.05 100.4% 0+0k 0+0io 1036pf+0w ------------------------------------------------------------------------------ (4) program = jacobi11.f DIMENSION= 11 #JACOBI ROT CYC= 5* 200000 EMIN= -0.663815 EMAX= 10.309197 20.077u 0.030s 0:20.07 100.1% 0+0k 0+0io 1047pf+0w ------------------------------------------------------------------------------ (5) program = jacobi1h.f DIMENSION=101 #JACOBI ROT CYC= 5* 200 EMIN= -3.859769 EMAX= 104.276991 8.983u 0.000s 0:09.05 99.2% 0+0k 0+0io 1108pf+0w ------------------------------------------------------------------------------ (6) program = leqs1k.f DIM= 1001 #INV= 5 RESULTS: 0.9983222082 0.9999235137 1.0001292085 56.296u 0.031s 0:56.38 99.8% 0+0k 0+0io 3014pf+0w ------------------------------------------------------------------------------ (7) program = leqs4h.f DIM= 401 #INV= 78 RESULTS: 0.9989295956 0.9989933805 0.9982736386 35.265u 0.000s 0:35.27 99.9% 0+0k 0+0io 1367pf+0w ------------------------------------------------------------------------------ (8) program = mathfnc1.f INTEGRAL[ 0.1 0.9: 100000000 STEPS](SIN(X)+SQRT(COS(X)))DX= 1.111225554 11.327u 0.015s 0:11.31 100.1% 0+0k 0+0io 1051pf+0w ------------------------------------------------------------------------------ (9) program = mathfnc2.f INTEGRAL[ 0.1 0.9: 100000000 STEPS]ATAN2(EXP(X),LOG(X+1))DX= 1.081785145 46.280u 0.015s 0:46.31 99.9% 0+0k 0+0io 1055pf+0w ------------------------------------------------------------------------------ (10) program = matvec.f MULTIPLY 1023*1023 REAL MATRIX TO VECTOR 3* 2000 TIMES. LARGEST EIGENVALUES= 1023.93053 1022.12165 1021.00563 15.515u 0.030s 0:15.50 100.2% 0+0k 0+0io 3099pf+0w ------------------------------------------------------------------------------ (11) program = matvecz.f MULTIPLY 723* 723 COMPLEX MATRIX TO VECTOR 3* 1000 TIMES LARGEST EIGENVALUES= 723.98791 722.12717 720.97077 10.311u 0.015s 0:10.33 99.9% 0+0k 0+0io 3099pf+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.311u 0.015s 0:02.36 98.3% 0+0k 0+0io 1038pf+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 2.780u 0.046s 0:02.78 101.4% 0+0k 0+0io 1069pf+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 36.327u 0.030s 0:36.38 99.9% 0+0k 0+0io 2063pf+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 19.905u 0.015s 0:19.93 99.8% 0+0k 0+0io 1052pf+0w ------------------------------------------------------------------------------ completed at Sat Feb 10 22:38:31 2007