mirror of
https://github.com/amadvance/snapraid.git
synced 2026-10-26 02:49:02 -04:00
Update manual
This commit is contained in:
parent
d452b109bc
commit
e4b81d74b4
3 changed files with 16 additions and 36 deletions
12
snapraid.1
12
snapraid.1
|
|
@ -1109,34 +1109,22 @@ such as K, M, or G (e.g., \-\-bw\-limit 1G).
|
|||
.TP
|
||||
.B \-A, \-\-stats
|
||||
Enables an extended status view that shows additional information.
|
||||
.PP
|
||||
.RS 4
|
||||
The screen displays two graphs:
|
||||
.RE
|
||||
.PP
|
||||
.RS 4
|
||||
The first graph shows the number of buffered stripes for each
|
||||
disk, along with the file path of the file currently being
|
||||
accessed on that disk. Typically, the slowest disk will have
|
||||
no buffer available, which determines the maximum achievable
|
||||
bandwidth.
|
||||
.RE
|
||||
.PP
|
||||
.RS 4
|
||||
The second graph shows the percentage of time spent waiting
|
||||
over the past 100 seconds. The slowest disk is expected to
|
||||
cause most of the wait time, while other disks should have
|
||||
little or no wait time because they can use their buffered stripes.
|
||||
This graph also shows the time spent waiting for hash
|
||||
calculations and RAID computations.
|
||||
.RE
|
||||
.PP
|
||||
.RS 4
|
||||
All computations run in parallel with disk operations.
|
||||
Therefore, as long as there is measurable wait time for at
|
||||
least one disk, it indicates that the CPU is fast enough to
|
||||
keep up with the workload.
|
||||
.RE
|
||||
.TP
|
||||
.B \-Z, \-\-force\-zero
|
||||
Forces the insecure operation of syncing a file with zero
|
||||
|
|
|
|||
|
|
@ -831,22 +831,18 @@ Options
|
|||
|
||||
-A, --stats
|
||||
Enables an extended status view that shows additional information.
|
||||
|
||||
The screen displays two graphs:
|
||||
|
||||
The first graph shows the number of buffered stripes for each
|
||||
disk, along with the file path of the file currently being
|
||||
accessed on that disk. Typically, the slowest disk will have
|
||||
no buffer available, which determines the maximum achievable
|
||||
bandwidth.
|
||||
|
||||
The second graph shows the percentage of time spent waiting
|
||||
over the past 100 seconds. The slowest disk is expected to
|
||||
cause most of the wait time, while other disks should have
|
||||
little or no wait time because they can use their buffered stripes.
|
||||
This graph also shows the time spent waiting for hash
|
||||
calculations and RAID computations.
|
||||
|
||||
All computations run in parallel with disk operations.
|
||||
Therefore, as long as there is measurable wait time for at
|
||||
least one disk, it indicates that the CPU is fast enough to
|
||||
|
|
|
|||
36
snapraid.txt
36
snapraid.txt
|
|
@ -890,26 +890,22 @@ SnapRAID provides the following options:
|
|||
|
||||
-A, --stats
|
||||
Enables an extended status view that shows additional information.
|
||||
|
||||
The screen displays two graphs:
|
||||
|
||||
The first graph shows the number of buffered stripes for each
|
||||
disk, along with the file path of the file currently being
|
||||
accessed on that disk. Typically, the slowest disk will have
|
||||
no buffer available, which determines the maximum achievable
|
||||
bandwidth.
|
||||
|
||||
The second graph shows the percentage of time spent waiting
|
||||
over the past 100 seconds. The slowest disk is expected to
|
||||
cause most of the wait time, while other disks should have
|
||||
little or no wait time because they can use their buffered stripes.
|
||||
This graph also shows the time spent waiting for hash
|
||||
calculations and RAID computations.
|
||||
|
||||
All computations run in parallel with disk operations.
|
||||
Therefore, as long as there is measurable wait time for at
|
||||
least one disk, it indicates that the CPU is fast enough to
|
||||
keep up with the workload.
|
||||
The screen displays two graphs:
|
||||
The first graph shows the number of buffered stripes for each
|
||||
disk, along with the file path of the file currently being
|
||||
accessed on that disk. Typically, the slowest disk will have
|
||||
no buffer available, which determines the maximum achievable
|
||||
bandwidth.
|
||||
The second graph shows the percentage of time spent waiting
|
||||
over the past 100 seconds. The slowest disk is expected to
|
||||
cause most of the wait time, while other disks should have
|
||||
little or no wait time because they can use their buffered stripes.
|
||||
This graph also shows the time spent waiting for hash
|
||||
calculations and RAID computations.
|
||||
All computations run in parallel with disk operations.
|
||||
Therefore, as long as there is measurable wait time for at
|
||||
least one disk, it indicates that the CPU is fast enough to
|
||||
keep up with the workload.
|
||||
|
||||
-Z, --force-zero
|
||||
Forces the insecure operation of syncing a file with zero
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue