Improved Dynamic Time Slice Priority Scheduling Algorithm with Unknown Burst Time
Author(s):
A.sankar, G.Ananthnath
Keywords:
CPU scheduling algorithm, Average Waiting time, Average Turnaround Time, Number of Context Switches.
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.
Article Details
Unique Paper ID: 145572

Publication Volume & Issue: Volume 4, Issue 10

Page(s): 649 - 651
Article Preview & Download


Share This Article

Join our RMS



Conference Alert

NCSEM 2024

National Conference on Sustainable Engineering and Management - 2024

Last Date: 15th March 2024

Latest Publication

Call For Paper

Volume 10 Issue 10

Last Date for paper submitting for March Issue is 25 June 2024

About Us

IJIRT.org enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on editor@ijirt.org

Social Media

Google Verified Reviews

Contact Details

Telephone:6351679790
Email: editor@ijirt.org
Website: ijirt.org

Policies

Important Links

Browse Rsearch papers