23%
06.10.2023
The OpenHPC project has announced the release of OpenHPC 3.0. OpenHPC is a Linux Foundation collaborative project that “...initiated from a desire to aggregate a number of common ingredients ... The OpenHPC Project Releases OpenHPC 3.0
22%
12.05.2020
):
root@c31656cbd380:/# apt-get update
Get:1 http://security.ubuntu.com/ubuntu bionic-security InRelease [88.7 kB]
...
Fetched 18.0 MB in 9s (1960 kB/s)
After the package repositories are synced, I can
22%
11.04.2016
(csrow0 to csrow7).
Listing 1
Attribute Files for mc0
$ ls -s /sys/devices/system/edac/mc/mc0
total 0
0 ce_count 0 csrow1 0 csrow4 0 csrow7 0 reset_counters 0 size_mb
0 ce
22%
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
22%
23.03.2016
7
):
$ ls -s /sys/devices/system/edac/mc/mc0
total 0
0 ce_count 0 csrow1 0 csrow4 0 csrow7 0 reset_counters 0 size_mb
0 ce_noinfo_count 0 csrow2 0 csrow5 0 device 0 sdram
22%
17.06.2017
integer :: allocate_status
08 !
09 n = 10
10 allocate( array(n, n), stat = allocate_status )
11 if (allocate_status /= 0) stop "Could not allocate array"
12 !
13 subarray => array(3:7,3:7)
14
22%
12.02.2014
B xsettings-kde
...
12.3 MiB + 2.2 MiB = 14.6 MiB gedit
22.9 MiB + 4.0 MiB = 26.9 MiB plasma-desktop
26.4 MiB + 5.7 MiB = 32.1 MiB konsole (3)
28.3 MiB + 4.4 MiB = 32.7 MiB kwin
147
22%
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
22%
01.06.2024
_Comm_size(MPI_COMM_WORLD, &nodenum);
21 long recieved[nodenum];
22 long recvniter[nodenum];
23 srand(SEED+myid); //Give rand() a seed value. Needs to be different on each node
24
25 if(myid != 0
22%
07.01.2014
.
The approach used by Rubel has several advantages. The first is that the most recent backup, backup.0
, always contains the full backup and backup.1
through backup.
<
N
>, where <N> is the last incremental
