25%
28.11.2023
Ripgrep gives you by default, set the -C <n> option, where <n> denotes the number of lines before and after the location you want to view. To check a certain number of lines exclusively before the find
25%
06.10.2022
B) copied, 1.99686 s, 210 MB/s
Infos
"Data Compression as a CPU Benchmark" by Federico Lucifredi, ADMIN
, issue 66, 2021, pg. 94, https://www.admin-magazine.com/Archive/2021/66/Data-Compression-as-a
25%
25.10.2011
1
05 set remote-gw 192.168.1.31
06 set psksecret
ENC kB+sdP4e109vAROdm9TRn9YIzA47T3JHPK4xVOzYu/8nc3wmqBknMZBzfHU7VRuWBF2gncDuHY1ubeCk9DU3zasHi61Izu0m6cg1cdERjgNmKKcO
07 set keepalive
25%
25.02.2013
on the options you chose, but some sample output is shown in Listing 1.
Listing 1: Sample iostat Output
[laytonj@home8 IOSTAT]$ iostat -c -d -x -t -m /dev/md1 2 100
Linux 2.6.18-308.16.1.el5.centos.plus (home8
25%
30.11.2025
.894212] vmware-hostd[3870]: segfault at 2100001c4f ip 0000003c0cb32ad0 sp 00007f3889e9cb88 error 4 in libc-2.12.90.so[3c0ca00000+19a000]
Analysis and Plan A
Initial analysis proved that the VMware ... 3
25%
30.11.2025
Destination MAC address
Listing 1
Nemesis arp Packets
01 $ while true
02 > do
03 > sudo nemesis arp -v -r -d eth0 -S 192.168.1.2 -D 192.168.1.133 -h 00:22:6E:71:04:BB -m 00:0C:29:B2:78:9
25%
30.11.2025
set remote-gw 192.168.1.31
06 set psksecret ENC kB+sdP4e109vAROdm9TRn9YIzA47T3JHPK4xVOzYu/8nc3wmqBknMZBzfHU7VRuWBF2gncDuHY1ubeCk9DU3zasHi61Izu0m6cg1cdERjgNmKKcO
07 set keepalive 600
08 next
25%
20.04.2022
very useful metadata.
In the Linux kernel, names can be a maximum of 255 bytes and the value can be up to 65,536 bytes (64KiB). XFS and ReiserFS allow these limits; however, ext3/4 and Btrfs impose
25%
21.08.2014
troubleshooting or address performance issues on your Ethernet network, it helps to have some basic knowledge of Spanning Tree.
Understanding Spanning Tree
Figure 1 shows three examples (A, B, C) of topologies
25%
01.06.2024
is considered "embarrassingly parallel" [3] where no design effort is required to partition the problem into completely separate parts. If no data dependency exists between the problem sub-parts, no communication
