Round Robin Backup Scheduling

Round robin scheduling is an algorithm that engages all objects (e.g. data) in some cycle of processing. When completing operations over the last object in a cycle, the round robin scheduling algorithm uses a first object as next input item. This technique guarantees completing operations over all objects in a list

Download for Free

Version 8.6.2 , built on April 17, 2025. 118 MB
30-day full-featured trial period

Definition of Round Robin Scheduling

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.

Note: The main areas of implementation for a round robin scheduling algorithm are parallel processes, network package transmission and other resource-dependent tasks in modern IT.

Using the Round Robin Scheduling Algorithm in Handy Backup

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.