17%
06.10.2019
# Configuration for the seed node DC1N1
04 # The name could stand for datacenter 1, node 1
05 DC1N1:
06 image: cassandra:3.10
07 command: bash -c 'if [ -z "$$(ls -A /var
17%
06.10.2019
": executable file not found in $PATH
0a2091b63bc5de710238fadc68ba3f5e0f9af8800ec7f76fd52a84c49a1ab0a7
Listing 3 shows that I do have a working container, so I'll deal with the network namespace
error now
16%
08.06.2021
= np.random.rand(nx,ny)
c = np.dot(a,b)
stop = time.perf_counter()
print("Elapsed time = ",(stop-start)," secs")
print(" ")
The Legate version of the code simply changes the import
command to:
import legate.numpy as np
16%
17.02.2015
e syscall=2
success=yes exit=3 a0=7fff67b1e9fc a1=0 a2=1fffffffffff0000 a3=3109e85ad0
items=1 ppid=7144 pid=11992 auid=1000 uid=1000 gid=1000 euid=1000 suid=1000
fsuid=1000 egid=1000 sgid=1000 ... 25
16%
25.03.2020
ZJOUoUsZGlkk
client2:q0eL78zFrbnESW6c/F0qit5MNCpS8IBgyh1BdXiyyuI
client3:zkq8eT31Nib3IHWfp0yyu15BCW52VMbY8+LhVUt3ylA
The client uses the appropriate password in the /etc/stunnel/psk-client1.txt file:
client1:Wf
16%
10.06.2015
(c) 1999-2010 Igor Pavlov 2010-11-18
p7zip Version 9.20 (locale=en_US.UTF-8,Utf16=on,HugeFiles=on,1 CPU)
Scanning
Creating archive hpc_001.html.7z
Enter password (will not be echoed) :
Verify password
16%
02.08.2022
.
The primary changes made to the benchmarks of the latest version 3.4.2 of the NPB are:
added class F to the existing S, W, A, B, C, D, E
added dynamic memory allocation
added MPI and Open
16%
04.12.2024
Attaching an iSCSI Device
$ uname -a
Linux DANSBOX 6.8.0-35-generic #35-Ubuntu SMP PREEMPT_DYNAMIC Mon May 20 15:51:52 UTC 2024 x86_64 x86_64 x86_64 GNU/Linux
$ lsblk
NAME MAJ:MIN RM SIZE RO TYPE
16%
28.07.2025
--serial 05:0e:50:04:eb:b0:35:ad:e9:d7:6d:c1:0b:36:d6:0e:33:f1--signature-algorithm1.2.840.10045.4.3.2--issuer-o Let's Encrypt--pubkey-algorithm rsa--pubkey-size 256
This check would give you a pretty good
16%
28.07.2025
[i] + b[i];
}
When the number of cycles is known at compile time, a loop can be fully unrolled:
c[0] = a[0] + b[0];
c[1] = a[1] + b[1];
c[2] = a[2] + b[2];
c[3] = a[3] + b[3];
However, it remains
