Fairness in CPU Scheduling: A Probabilistic Algorithm

This paper introduces a novel CPU scheduling algorithm for uniprocessor systems that employs a probabilistic function to enhance fair resource allocation. Unlike traditional algorithms, our approach specifically tackles the challenge of equitable resource distribution by integrating a probabilistic methodology whilst also keeping the priority of each process in mind. We detail the implementation and evaluate its performance against established algorithms, assessing metrics such as average turnaround time, average waiting time and the gini index. All the related code, data used for testing and a working webpage to try out the algorithm first hand can be found at GitHub.