Abstract
The objective of this paper is to introduce a new CPU Scheduling Algorithm called time quantum based CPU Scheduling Algorithm which acts as preemptive based on the arrival time. The algorithm helps to improve the average waiting time of Round Robin algorithm in real time uniprocessor-multi programming operating system. CPU Scheduling is the basis of multi-programmed operating system. The scheduler is responsible for multiplexing processes on the CPU. There are many scheduling algorithms available for a multi-programmed operating system like FCFS, SJF, Priority, Round Robin etc. The proposed algorithm is based on Round robin scheduling . In this paper, the results of the existing Round Robin algorithm is compared with the proposed algorithm General Terms CPU Scheduling Algorithms, Context Switching.
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
