Backup Software / Backup Terms Glossary / Backup Practices / Round Robin Scheduling Algorithm
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
Version 8.0.6, built on 2 October, 2019 105 MB
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.
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.
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.
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.
Copyright © 2004-2019 Novosoft LLC. All rights reserved. Handy Backup software.
10685-B Hazelhurst Dr., Houston, TX 77043, United States Tel.: +1 (707) 703-13-11
Back to Top