29%
04.11.2011
with most hardware-based solutions. At the same time, the pool of available storage can be managed dynamically using LVM2 [9]. With these two tools, you have a very inexpensive approach to implementing
29%
07.11.2011
understanding of parallel computing [1]. I used the Ubuntu 9.10 x86_64 desktop distribution along with Python 2.7 to test the code in this article and to generate the screen shots.
Breaking GIL and Extracting
29%
20.06.2012
fingerprint is:
a9:90:af:81:69:fc:4f:b5:ef:6e:b5:d4:b7:cb:c6:02 laytonjb@test1
The key's randomart image is:
+--[ RSA 2048
29%
06.08.2012
-07-28 19:06 .bash_history
-rw-r--r-- 1 khess khess 220 2012-05-25 22:11 .bash_logout
-rw-r--r-- 1 khess khess 2940 2012-05-25 22:11 .bashrc
To show files in date-sorted order, try the following commands
29%
25.01.2017
to maintain program correctness. Listing 1 is an example of the ways you can define a coarray.
Listing 1: Defining Coarrays
integer :: x[*] ! scalar coarray
real, dimension(n) :: a
29%
18.10.2017
(0x00007f5bc5d5d000)
libpgf902.so => /opt/pgi/linux86-64/16.10/lib/libpgf902.so (0x00007f5bc5b4a000)
libpgftnrtl.so => /opt/pgi/linux86-64/16.10/lib/libpgftnrtl.so (0x00007f5bc5914000
29%
16.07.2019
code that Numba understands, it is compiled to machine code with LLVM. This compilation happens the first time you execute the code. The example code in Listing 1 is borrowed from a
29%
11.05.2021
, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192]
A = single( rand(N,N) );
B = single( rand(N,N) );
start = clock();
C = A*B;
elapsedTime = etime(clock(), start);
gFlops = 2*N*N*N / (elapsedTime * 1e+9);
disp(sprintf("N = %4d
29%
23.03.2022
17495 17495 0 100% /snap/gnome-3-38-2004/99
/dev/sda1 183144448 38466772 144677676 22% /home2
/dev/loop9 64986 64986 0 100% /snap/gtk-common-themes/1515
/dev/loop11
29%
10.06.2024
Livermore National Labs also generated some excitement. It uses AMD MI300A accelerated processing units (APUs), and the HPE Slingshot network will be used in a Dragonfly topology. Much of the discussion