Start Benchmarking A: scalar product = 2.5e+08 N = 250000000 Time for Nloops: 11 Timing in sec. : 0.21 GFLOPS : 2.2 GiByte/s : 17 Start Benchmarking A: scalar product with cblas = 2.5e+08 N = 250000000 Time for Nloops: 5.7 Timing in sec. : 0.11 GFLOPS : 4.1 GiByte/s : 33 Start Benchmarking A: scalar product with Kahan summation = 2.5e+08 N = 250000000 Time for Nloops: 11 Timing in sec. : 0.22 Start Benchmarking A_norm: euclidean norm ||x|| = 1.6e+04 N = 250000000 Time for Nloops: 6.1 Timing in sec. : 0.12 GFLOPS : 3.8 GiByte/s : 15 Start Benchmarking B: Matrix-Vector Product (row wise access) = 8e+03 N = 8000 M = 8000 Time for Nloops: 10 Timing in sec. : 0.026 GFLOPS : 4.7 GiByte/s : 37 Start Benchmarking B: Matrix-Vector Product (column wise access) = 8e+03 N = 8000 M = 8000 Time for Nloops: 13 Timing in sec. : 0.032 GFLOPS : 3.7 GiByte/s : 30 Start Benchmarking B: Matrix-Vector Product with cblas (row wise access) = 8e+03 N = 8000 M = 8000 Time for Nloops: 13 Timing in sec. : 0.032 GFLOPS : 3.8 GiByte/s : 30 Start Benchmarking C: Matrix-Matrix Product C[10,15] = 4e+03 N = 4000 M = 4000 L = 4000 Time for Nloops: 29 Timing in sec. : 29 GFLOPS : 4 GiByte/s : 0.012 Start Benchmarking C: Matrix-Matrix Product mit cblas C[10,15] = 4e+03 N = 4000 M = 4000 L = 4000 Time for Nloops: 6.2 Timing in sec. : 0.62 GFLOPS : 1.9e+02 GiByte/s : 0.58 Start Benchmarking D: polynomial evaluation p(x[0]) = 1 p = 10000 N = 100000 Time for Nloops: 17 Timing in sec. : 1.2 GFLOPS : 1.6 GiByte/s : 13 Solving system of linear equations Timing in sec. : 0.4 for nrhs= 1 Timing in sec. : 0.4 for nrhs= 2 Timing in sec. : 0.43 for nrhs= 4 Timing in sec. : 0.47 for nrhs= 8 Timing in sec. : 0.54 for nrhs= 16 Timing in sec. : 0.48 for nrhs= 32