Revitalising the Single Batch Environment: A 'Quest' to Achieve Fairness and Efficiency (2308.10062v7)
Abstract: In the realm of computer systems, efficient utilisation of the CPU (Central Processing Unit) has always been a paramount concern. Researchers and engineers have long sought ways to optimise process execution on the CPU, leading to the emergence of CPU scheduling as a field of study. This research proposes 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 utilising periodic sorting technique to achieve fairness. By engineering this responsive and fair model, the proposed algorithm strikes a delicate balance between efficiency and fairness, providing an optimised solution for batch scheduling while ensuring system responsiveness.
- \bibcommenthead
- Conway, R.W.: ” theory of scheduling,”. Addison Wesley (1967)
- Krzyzanowski, P.: Process scheduling. Information on http://www. cs. rutgers. edu/~ pxk/416/notes/07-scheduling. html.–2015 (2015)
- CFS Scheduler — The Linux Kernel documentation — docs.kernel.org. https://docs.kernel.org/scheduler/sched-design-CFS.html. [Accessed 09-04-2024]
- FLEMING’S, G.A.: The new method of adaptive cpu scheduling using fonseca and fleming’s genetic algorithm. Journal of Theoretical and Applied Information Technology 37(1) (2012)
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.
