Абстрактный

Weighted Mean Priority Based Scheduling for Interactive Systems

H.S.Behera, Sabyasachi Sahu and Sourav Kumar Bhoi

Scheduling in Operating System means determining which tasks are supposed to run when there are multiple tasks to be run. Consequently, the efficiency and performance of a system mainly depends on CPU scheduling algorithm where CPU is considered as one of the primary computer resource. Traditionally, Priority Scheduling Algorithm is used for processes in which priority is the determining factor. This paper proposes a newly improved process scheduling algorithm by using dynamic time quantum along with weighted mean. Experimental analysis demonstrates that this proposed algorithm gives better response time making the algorithm useful for interactive systems.