49%
04.04.2023
-mod-slurm-ohpc x86_64 2.34-9.1.ohpc.2.6 OpenHPC-updates 13 k
slurm-devel-ohpc x86_64 22.05.2-14.1.ohpc.2.6 OpenHPC-updates 83 k
slurm-example-configs-ohpc x86
49%
18.07.2012
[laytonjb@n0001 ~]$ module avail
------------------------------- /opt/Modules/versions ------------------------------
3.2.9
--------------------------- /opt/Modules/3.2.9/modulefiles
49%
02.06.2020
:40:04Z"
14 },
15 "entity": {
16 "host": "tired-duck-brash-civet",
17 "path": "",
18 "domain_guid": "fb6bd89f-2ed9-49d4-9ad1-97951a573135",
19 "space_guid": "d6
49%
25.03.2020
GVzLmlvL3NlcnZpY2VhY2NvdW50L3NlcnZpY2UtYWNjb3VudC51aWQiOiJiNDVhMDhjMi1kMzg1LTQxMmItOTUwNS02YmRmODdiNjRhN2EiLCJzdWIiOiJzeXN0ZW06c2VydmljZWFjY291bnQ6ZGVmYXVsdDp0ZXN0c2VydmljZWFjY291bnQifQ.SO9XwM3zgiW6sOfEaJx1P6
49%
05.12.2019
).
Figure 1: Flattening a 2D array in C or C++.
Listing 3
inspect.c
#include
**
int a[4][5] = { // array of 4 arrays of 5 ints each, a 4x5 matrix
{ 1, 2, 3
49%
12.02.2014
B hald-addon-input
...
22.9 MiB + 4.0 MiB = 26.9 MiB plasma-desktop
26.0 MiB + 5.7 MiB = 31.7 MiB konsole (3)
28.3 MiB + 4.4 MiB = 32.7 MiB kwin
41.0 MiB + 2.0 MiB = 43.0 MiB Xorg
146.9
49%
16.01.2013
$ starcluster start -s 1 foocluster -n ami-999d49f0
$ starcluster get foocluster /opt/sge6-fresh .
$ starcluster terminate foocluster
$ starcluster start -o -s 1 -i t1.micro -n ami-e2a0058b imagehost
49%
01.06.2024
simulations.
sudo apt install openmpi-bin openmpi-common openmpi-doc libopenmpi-dev
The code as listed runs 1 million iterations, which I can launch over two Xeon Broadwell cores,
mpiexec -n 2 mpi
49%
12.05.2021
.xz 100%[=============================================================================================>] 1.77M 8.85MB/s in 0.2s
2021-03-21 15:40:30 (8.85 MB/s) - ‘perf-5.9.0.tar.xz’ saved [1857268
49%
09.01.2019
of the loop, n
, is large enough, some processing hardware can greatly speed up the computation.
What happens if z(i)
depends on a previous value, as in the following:
do i = 2,n
z(i) = z(i-1)*2
enddo
