This project is the implementation of a scheduling algorithm called Completely Fair Scheduler.
Completely Fair Scheduler is a process scheduling used main on linux OS to handle application and system processes.
The Red Black Tree data structure is used to solve the scheduling problem.
Red Black Tree is a self balancing binary tree that have a run time of O(log n) searching, deleting and inserting.
(1) Java JDK 17.2
(2) Windows OS or Linux OS.
(3) 4gb Ram or morer.
(4) 1gb free space HDD or SSD or more.