Round Robin Scheduling Algorithm

The term “round robin scheduling” means the method of relatively even distributing of time and resources between tasks and objects of about equal importance, to make sure that all operations will complete in a reasonable time with approximately even consumption of time and efforts.

Keeping a Preset Quantity of Old Versions for Backup Data

When you set up a task to keep some versions of the same dataset, you are using round robin scheduling. After taking a defined quantity of versions, the program will start again from number 1.

Mixed Backup Techniques

In Handy Backup, the standard mixed backup methods (full/incremental and full/differential) are the examples of robin scheduling algorithm, processing the same dataset in a cycle.

Complex Backup Strategies

With standard scheduling methods, handy backup allows implementing round robin scheduling algorithm repeatedly, to realize some backup strategies such as Grandfather-father-son backup, or Tower of Hanoi scheduling strategy.