9%
07.11.2011
#pragma omp parallel for shared (sum) private (i)
12 for ( i=0; i < 1000000; i++) {
13 #pragma omp critical (sum_total)
14 sum = sum + a[i];
15 }
16 printf("sum=%lf\n",sum);
17
9%
09.08.2015
in 2011. A management buy-out at the end of 2013 coincided with a company restructuring and the release of Scalix 12.0. With a small intermediate step, the current version 12.5 (Figure 7) rolled out
9%
10.06.2015
11 echo "Difference:"
12 diff -u --label EXPECTED_RESULT --label ACTUAL_RESULT -- \
$script_output - <<<"$res"
13 return 1
14 fi
15 }
16
17 failed=0
18
19
9%
30.11.2025
_NOT_RUNNING
08 fi
09
10 pid=`cat $ASTRUNDIR/asterisk.pid`
11 ocf_run kill -s 0 $pid
12 rc=$?
13
14 if [ $rc -eq 0 ]; then
15 if ocf_is_true "$OCF_RESKEY_realtime"; then
16
9%
15.12.2016
are over i
= 2,n
− 1 and j
= 2,n
−1. Here is how you can write the iteration over the domain using array notation:
a(2:n-1,2:n-1) = 0.25 * &
(a(1:n-2,2:n) + a(3:n,2:n) + a(2:n,1:n-2) + a(2:n,3:n
9%
18.09.2017
in the Fortran programfor a longer run time:
nx = 8000
ny = 8000
i
t_max = 10000
tolerance = 0.00004D+00
The code was compiled using GCC 7.1 and run on a four-core AMD A6-6310 laptop (Lenovo
9%
04.10.2018
statistics ---
3 requests completed in 623.9 us, 12 KiB read, 4.81 k iops, 18.8 MiB/s
generated 4 requests in 3.35 s, 16 KiB, 1 iops, 4.77 KiB/s
min/avg/max/mdev = 200.4 us / 208.0 us / 221.4 us / 9.51 us
9%
02.06.2020
= sol.copy()
10
11 for j in range(0,ny-1):
12 sol[0,j] = 10.0
13 sol[nx-1,j] = 1.0
14 # end for
15
16 for i in range(0,nx-1):
17 sol[i,0] = 0.0
18 sol[i,ny-1] = 0.0
19 # end for
20
21 # Iterate
22
9%
14.03.2018
– comparable to setting an interface route with:
ip route add 1.2.3.0/24 dev eth0
Conversely, the external VPC must know how to find the internal VPC, which requires routes to the internal subnet and also
9%
17.05.2017
, 5 ) / ( 8, 5 ) }
DATA {
(0,0): 0, 1, 2, 3, 4,
(1,0): 5, 6, 7, 8, 9,
(2,0): 10, 11, 12, 13, 14,
(3,0): 15, 16, 17, 18, 19,
(4,0): 20, 21, 22, 23, 24,
(5,0): 25, 26, 27, 28, 29,
(6,0
