Effectiveness of PBTs Scheduling Algorithm for Mobile System: Deterministic Approach

Processor is a very crucial part of any system. Any operating system is assessed by its efficiency of managing various system activities. Processor scheduling and resource management are main functionalities done by operating system. Many algorithms are in existence for managing the processor scheduling. This paper proposes a new algorithm PBTS (Priority Based Time Slice Algorithm) which is based on priority preemptive and non-preemptive along with Round robin scheduling algorithm. The performance of this algorithm is compared with existing scheduling algorithms Priority (preemptive, nonpreemptive) and Round Robin algorithms in deterministic approach. These algorithms are compared on average waiting time, average turnaround time, CPU utilization and number of context switching. Paper also highlights the applications where PBTS algorithm would be beneficial.