Quantum time lenghth estimation for round-robin scheduling algorithm using neural networks

Abstract

In Round Robin (RR) scheduling algorithm that used for CPU scheduling is considered the fairness compromise algorithm among different mechanisms and disciplines that deals with sharing the CPU time between processes that resides in the ready queue. RR, First come first served, high priority, shortest job first and other algorithms have several disadvantages when dealing with real-time systems and deadline limitations. In real-world of time-sharing systems, RR service (behavior) is widely used.