Copyright © 2026 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{145572,
        author = {A.sankar and G.Ananthnath},
        title = {Improved Dynamic Time Slice Priority Scheduling Algorithm with Unknown Burst Time},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {4},
        number = {10},
        pages = {649-651},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=145572},
        abstract = {Operating System (OS) is the brain of computer system which can manages the resources available the system. OS controls the execution of many other application programs and acts as an interface between computer hardware and software. It has some attractive features like multiprogramming, multitasking and allows multi-users. Priority scheduling is one of the algorithms mostly used in time sharing system and in network scheduling. Time slices are assigned to each process in equal portions and it handling all processes in circular order without priority. Priority scheduling algorithm requires some parameter such as arrival time, burst time and quantum time which enables the scheduler to predict the behavior of possible processes. Prior to the execution of a process, the burst time is not known. This paper proposed a more improvement in the Priority scheduling algorithm improving the of Anju et.al algorithm. Where burst time is determined using an initial time quantum. However, the improved algorithm determines burst time using instruction counting each of the process and by experimental analysis. This proposed algorithm performs better than Dynamic Time Slice Round Robin Scheduling Algorithm with Unknown Burst Time in terms of minimizing average waiting time, average turnaround time and number of context switches.},
        keywords = {CPU scheduling algorithm, Average Waiting time, Average Turnaround Time, Number of Context Switches.},
        month = {},
        }