31%
09.10.2017
to adjust a few application parameters in the Fortran program for a longer run time:
nx = 8000
ny = 8000
it_max = 10000
tolerance = 0.00004D+00
The code was compiled using GCC 7.1 and run
31%
05.12.2014
takes everything literally, it is faster than grep. An example pattern file could look like this:
patternR2
patternD2
patternC3
patternP0
A very large logfile might also start with lots of similar
31%
10.04.2015
3
04 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
05 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
06 | Source Port
31%
14.05.2013
log in for terminal access:
ps –aef |grep ssh
This command shows the output:
root 571 1 0 Mar26 ? 00:00:00 /usr/sbin/sshd -D
Now I can SSH into the target box with my new user account and have
31%
01.02.2013
for it at /proc/loadavg/
[3]:
1.00 0.97 0.94 1/1279 7743
The three additional numbers provided by Linux are the number of running processes (one in this case), the total number of processes, and the last
31%
10.09.2013
.80
626.49
0.70%
FT
24,451.57
17,554.99
28.00%
IS
470.63
904.86
48%
LU
40,600.64
34,120.96
16.00%
MG ... New OpenMP 4.0 Spec
31%
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
31%
17.04.2017
to occur every night of the week at 3:00am. This involved backing up an entire Ubuntu installation in a bootable image on network-attached storage (NAS) in the local network (Figure 3). When backing up
31%
06.10.2022
find ready-made policy bundles online for many use cases, and they are likely to contain a useful, predefined set of rules. A freely accessible Playground [2] and a free Styra Academy [3] can help you
31%
07.02.2019
data copy(a)
!$acc parallel loop
do i=1,n
a(i) = 0.0
enddo
!$acc data end
#pragma acc data copy(a)
{
#pragma acc parallel loop
{
for (int i=0; i < n; i++)
{
a[i] = 0.0
