Revitalizing the single batch environment: a ‘Quest’ to achieve fairness and efficiency

In the realm of computer systems, efficient utilization of the CPU (Central Processing Unit) has always been a paramount concern. Researchers and engineers have long sought ways to optimize process execution on the CPU, leading to the emergence of CPU scheduling as a field of study. In this research, we have analyzed the single offline batch processing and investigated other sophisticated paradigms such as time-sharing operating systems and wildly used algorithms, and their shortcomings. Our work is directed toward two fundamental aspects of scheduling: efficiency and fairness. We propose a novel algorithm for batch processing that operates on a preemptive model, dynamically assigning priorities based on a robust ratio, employing a dynamic time slice, and utilizing periodic sorting to achieve fairness. By engineering this responsive and fair model, the proposed algorithm strikes a delicate balance between efficiency and fairness, providing an optimized solution for batch scheduling while ensuring system responsiveness.