13%
07.01.2024
loop /snap/core22/864
loop15 7:15 0 12.3M 1 loop /snap/snap-store/959
loop16 7:16 0 73.9M 1 loop /snap/core22/817
loop17 7:17 0 349.7M 1 loop /snap/gnome-3-38-2004/140
loop18
13%
30.11.2025
/0K /s] [4137 /0 iops] [eta 00m:06s]
In the example, the first job is performing a sequential read, marked as r in square brackets, while Fio hasn't initialized the second job, marked as P
13%
16.05.2013
="/var/run/mysqld/mysqld.pid" socket="/var/run/mysqld/mysqld.sock" op monitor interval="120s" timeout="60s" op stop interval="0" timeout="240s" op start interval="0" timeout="240s"
12 primitive p_nova-api-ec2 upstart:nova-api-ec2 op
13%
10.06.2014
Indiana, Illumian, EON, OmniOS, and Joyent’s SmartOS.
Joyent has put much effort into the development of SmartOS to create a highly flexible basis for its own cloud. To ensure this flexibility, Joyent, or more
13%
20.06.2022
Once your set of internal applications grows greater than an order of 10s, you can end up in a scenario where credentials storage for each service gets out of control. Users might start complaining
13%
03.02.2022
class BlazeDemoV1 extends Simulation {
08
09 var qualifiedhost = "http://blazedemo.com"
10 var proxyport = 0
11 var proxyhost = "not set"
12
13 // headers for HTTP call
14 val headers = Map(
15
13%
02.10.2012
a threat there’s a loosely followed rule of thumb that for every thousand lines of code you add to a server you potentially add another security hole. This is important because you can lock all the network
13%
07.11.2011
communication overhead, it’s free of the GIL issue and adequate most of the time when dealing with parallelism in Python programs.
If this picture seems complicated to you, don’t worry; you won’t have to deal
13%
06.10.2022
20G 22,38080,52812,58080
kafka 3 weaveworks/ignite-ubuntu:20.04 weaveworks/ignite-kernel:5.12.18 2 2G 20G 22,2181,8080,9092,38080,52812,58080
spark 3 weaveworks
13%
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