19%
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
18%
21.08.2012
6 ### 8/5/2012
7
8 ### Set the job name
9 #PBS -N mpi_pi_fortran90
10
11 ### Run in the queue named “batch”
12 #PBS -q batch
13
14 ### Specify the number of cpus for your job. This example
18%
17.02.2015
Linux
Xilinx Zynq-7020 or -7010
Dual ARM Cortex-A9 @667MHz plus FPGA, 16-core Epiphany RISC coprocessor (32-bit)
1GB DDR3
GigE Ethernet, USB 2.0, micro ... 25
18%
01.06.2024
-mgmt-runtime-daemon-vfsrj
edb4568bd80eb 08616d26b8e74 7 months ago Running calico-node 1 c6aba3d4b683e calico-node-92zq7
c55945531ebc7 a7f25b1a3cf06 7 months ago
18%
25.09.2023
guest
82a84,88
>
> tee /etc/.htpasswd <<'EOF'
> guest:$apr1$gz4n7s6o$P.O/V1k9rZuV9nN/5lh3l0
> admin:$apr1$esczj7wu$ffu/6j8vETMAMJaVTKn7a1
> EOF
Monit is configured to load service
18%
07.02.2019
) copyout(f)
do j=1,n
f(i) = 2.0*e(j) +
(1.0/4.0)*(a(j)*4.14)
end
!$acc end data
#pragma acc data copyin(a, b) copy(c) {
#pragma acc parallel loop {
for (int i=0; i < n
18%
04.08.2020
->tv_nsec) * 1E-9;
24 }
25
26 int main(int argc, char* argv[argc+1]) {
27 if (argc < 2) {
28 fprintf(stderr, "Usage: %s NNN, NNN iterations\n",
29 argv[0]);
30 return EXIT_FAILURE;
31 }
32
18%
28.11.2023
for statpingng_stack.yml
6c6
< image: adamboutcher/statping-ng:${SPNGTAG:-latest}
---
> image: mystatpingng:${SPNGTAG:-latest}
8a9,36
> volumes:
> - ./config:/app
> environment
18%
21.08.2012
===================================================================================================
Install 20 Package(s)
Total size: 5.4 M
Total download size: 5.3 M
Installed size: 15 M
Is this ok [y/N]: y
Downloading Packages:
(1/19): cairo-1.8.8-3.1.el6.i686.rpm
18%
01.06.2024
code's critical section therefore determines how much the application can actually be accelerated: If one minute of a 20-minute process is single threaded, the maximum speedup theoretically possible
