Documentation for C-Werk 2.0.
Previous page
Next page
If there are several volumes in the object archive, the archive records are distributed among all volumes by the Round-robin algorithm.
The archive records are distributed in a round-robin cycle: the first interval of the key frames of a record is transferred to the first volume of the archive, then the next interval is transferred to another volume, and so on until the last volume is reached. The cycle is repeated until all key frames of the archive record are completely distributed over the available volumes.
This algorithm allows increasing the writing speed of the archive, as well as preventing the loss of records for a certain period, in case there are problems with the archive volumes, i.e., if the archive volume is lost, the records for the previous period will be available with frame decimation. This behavior is ensured because the key frames of records are distributed evenly over all available volumes of the archive.
Overview
Content Tools