17%
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
17%
02.06.2020
= sol.copy()
10
11 for j in range(0,ny-1):
12 sol[0,j] = 10.0
13 sol[nx-1,j] = 1.0
14 # end for
15
16 for i in range(0,nx-1):
17 sol[i,0] = 0.0
18 sol[i,ny-1] = 0.0
19 # end for
20
21 # Iterate
22
17%
04.10.2011
to process, and the longest you want a client to wait for the result is 10 minutes. Without changing the number of instances, the average wait time for the requests in the queue is [4 x (3 + 6 + 9 + 12 + 15
17%
09.12.2021
Version 16.02 (locale=en_US.UTF-8,Utf16=on,HugeFiles=on,64 bits,64 CPUs AMD Ryzen Threadripper 3970X 32-Core Processor (830F10),ASM,AES-NI)
Scanning the drive:
1 file, 11626 bytes (12 KiB)
Creating
17%
20.04.2017
Files are 10x bigger than in previous studies
Files are rarely reopened: >66 percent are reopened just once and 95 percent are opened fewer than five times
<1 percent of clients account for 50
17%
26.01.2025
the required cluster in just a few minutes. The following example assumes that all commands are run on Ubuntu 22.04, but most of the commands will probably work on other distributions with just a few minor
17%
07.10.2014
-dkms:i386 - Native ZFS filesystem kernel modules for Linux
20 v zfs-dkms-build-depends -
21 c zfs-fuse - ZFS als FUSE
22 p zfs-fuse:i386
17%
04.08.2020
return -timespec_diff(sooner, later);
19 else
20 return
21 (later->tv_sec - sooner->tv_sec)
22 /* tv_nsec is known to be a signed type. */
23 + (later->tv_nsec - sooner
17%
04.08.2020
node-builder_1 |
18 node-builder_1 | npm install -g pushstate-server
19 node-builder_1 | pushstate-server build
20 node-builder_1 | open http://localhost:9000
21 node-builder_1 |
22 node
17%
12.09.2013
sub 4096R/F6685248 2013-04-17
18 $ sudo apt-get update
19 [...]
20 $ sudo apt-get install tkmon
21 [...]
22 The following NEW packages will be installed:
23 tkmon
24 [...]
Conclusions
