30%
20.10.2016
writing code. Columns 1 to 5 could be used for statement labels such as the following:
...
SUM = 0.0
D0 100 I=1,10
SUM = SUM + REAL(I)
100 CONTINUE
...
Y = X1 + X2 + X3
30%
22.05.2012
/group_gz | 212 kB 00:00
Package flex-2.5.35-8.el6.x86_64 already installed and latest version
Package gcc-4.4.6-3.el6.x86_64 already installed and latest version
Package autoconf-2.63-5.1.el6.noarch
30%
30.01.2020
its execution in the real world (real), as well as how much CPU time was allocated in user and kernel (sys) modes:
$ time sleep 1
real 0m1.004s
user 0m0.002s
sys 0m0.001s
What not everyone knows
30%
18.12.2013
(One-by-One)
1 #include
2
3 /* Our structure */
4 struct rec
5 {
6 int x,y,z;
7 float value;
8 };
9
10 int main()
11 {
12 int counter;
13 struct rec my_record;
14 int counter_limit;
15
30%
07.01.2014
[laytonjb@home4 TEST]$ rsync -a --delete /home/laytonjb/TEST/SOURCE/ backup.0
[laytonjb@home4 TEST]$ ls -s
total 8
4 backup.0/ 4 SOURCE/
[laytonjb@home4 TEST]$ du -sh
16M .
[laytonjb@home4 TEST]$ du -sh
29%
03.07.2013
or processes are used, performance does not improve (wall clock time does not change).
To better understand how Amdahl’s Law works, consider a theoretical application that is 80% parallelizable (20% serial
29%
30.11.2025
04 errs: 0, errxfer: 0.0k, succxfer: 1667072.0k
05 +curr.rate: 5270kB/s, avg.rate: 5808kB/s, avg.load: 8.1%
The resulting image, sdb
29%
05.06.2013
, learning curve, ease of use, complexity, and, doggone it, just plain fun. But the focus is to keep the cost down while you are learning. The one aspect of clusters that I’m not really going to focus
29%
05.08.2024
= [size][size]int {{0},{0},}
08
09 for i := 0; i < size; i++ {
10 for j := 0; j < size; j++ {
11 array[i][j]++
12 }
13 }
14
15
29%
05.12.2019
0 20:44 pts/8 00:00:00 grep --color sleep
Users can therefore run software in a container under the root user context without problems and without having to give the software root privileges
