15%
17.06.2017
Code
11111111112222222222
12345678901234567890123456789
-----------------------------
SUM = 0.0
D0 100 I=1,10
SUM = SUM + REAL(I)
100 CONTINUE
...
Y = X1 + X2
15%
31.05.2012
_mat_stat
3.37
39.34
11.64
54.54
22.07
8.12
rand_mat_mul
1.00
1.18
0.70
1.65
8.64
41.79
Table 1: Benchmark Times
15%
29.09.2020
and doubles the cache size (from 3 to 6MB), in exchange for a small drop in baseline clock speed – 2.3 to 2.2GHz (peak drops from 3.2 to 3.1GHz).
Major Surgery
Legend has it that no one has ever
opened
15%
04.08.2020
return -timespec_diff(sooner, later);
19 else
20 return
21 (later->tv_sec - sooner->tv_sec)
22 /* tv_nsec is known to be a signed type. */
23 + (later->tv_nsec - sooner
15%
14.03.2013
: 0
16 initial apicid : 0
17 fdiv_bug : no
18 hlt_bug : no
19 f00f_bug : no
20 coma_bug : no
21 fpu : yes
22 fpu_exception : yes
23 cpuid level : 10
24 wp
15%
19.11.2019
, ioengine=libaio, iodepth=32
fio-3.12
Starting 1 process
Jobs: 1 (f=1): [w(1)][100.0%][w=475MiB/s][w=122k IOPS][eta 00m:00s]
test: (groupid=0, jobs=1): err= 0: pid=1634: Mon Oct 14 22:18:59 2019
write: IOPS=118k, BW=463Mi
15%
30.01.2020
: 1 (f=1): [w(1)][100.0%][r=0KiB/s,w=1401KiB/s][r=0,w=350 IOPS][eta 00m:00s]
test: (groupid=0, jobs=1): err= 0: pid=3104: Sat Oct 12 14:39:08 2019
write: IOPS=352, BW=1410KiB/s (1444kB/s)(82.8Mi
15%
02.02.2021
.sin(periods * 2 * np.pi * t)
12 return max(value, 0.0)
13 else:
14 value = np.sin(periods * 2 * np.pi * t)
15 return max(value, 0.0)
16
17 # building the data vector
18 my_data = []
19 i = 0
20 while
15%
18.07.2013
: 156301488
20 Logical Sector size: 512 bytes
21 Physical Sector size: 512 bytes
22 device size with M = 1024*1024: 76319 MBytes
23
15%
30.11.2020
):
11
12 s = 0.0
13 s += h * f(a)
14 for i in range(1, n):
15 s += 2.0 * h * f(a + i*h)
16 # end for
17 s += h * f(b)
18 return (s/2.)
19 # end def
20
21
22 # Main section
23 comm = MPI
