Publication

Abstract : Scheduling is vital in operating systems, controlling process resource access. Round Robin stands out among traditional algorithms due to its improved performance, unlike First Come First Serve (FCFS) or Shortest Job First (SJF). While the Priority-based scheduling algorithm executes processes depending on their priority, the proposed algorithm is particularly designed for time-sharing systems. The paper aims to improve system performance, reduce latency, and enhance overall responsiveness in multitasking environments. The time quantum assigned ensures fair allocation of CPU to all the processes getting executed. Based on their burst time and assigned priorities, different processes can be divided within multi-level queues. Multilevel queues adjust task priorities based on the time execution. The use of priority for each process enables prioritization of the important processes in each queue. Decrementing the priority based on the time taken to execute, is an efficient solution to reduce the starvation time of the other processes. It shows a reduction in turn-around time. The implementation will also include comprehensive performance evaluations and benchmarking against traditional scheduling algorithms, demonstrating the superiority and effectiveness of the proposed scheduler in real-world scenarios.