Dynamic Time Quantum in Shortest Job First Scheduling Algorithm (DTQSJF) for Unpredictable Burst Time of Processes

Abstract

In multitasking and time sharing operating system the performance of the CPU depends on waiting time, response time, turnaround time, context switches from the process mainly depends on the scheduling algorithm. Shortest Job First(SJF) is one of the most widely used scheduling algorithm because it give less Average waiting Time compare to other Scheduling algorithm but this algorithm have some disadvantages. Here burst time of processes have to predict (i.e. how much time process will execute in CPU) before CPU start execution. But it is quite impossible to predict the Burst time of process before process complete execution and if processes did not finish their execution in predicted burst time then in which algorithm process will execute? If they execute in FCFS manner Average waiting time may increase and there is a possibility to occur starvation. In this paper based on the experiments and calculations a new algorithm is introduced. In this algorithm the main idea is if processes remain in ready queue after completion of their predicted Burst Time, a new quantum will generate dynamically and each non completed process will get that amount of time quantum to execute in CPU if any process does not completed after execution of that amount of time (Time Quantum) it will go to tail of the ready queue and waiting for it’s turn.

Authors and Affiliations

Dibyendu Barman , Iti Sarkar

Keywords

Related Articles

A New Multi-hop approach for sensing coverage in wireless sensor network

Sensor networks provide a strong combination of distributed sensing, computing and communication. Wireless sensor networks (WSNs) are recently rapidly growing research area in wireless communications. WSNs are studied wi...

A GIS based Analysis for Rooftop Rain Water Harvesting

For properly Digitizing the Roof area of any building, some parameters need to be determined in order to get maximum benefit. Google Earth is used to determine the view or the area with proper resolution. The resolution...

Enhanced Energy Conserving Improved and Balanced LEACH for Heterogeneous Wireless Sensor Networks

Wireless sensor networks consists of thousands of tiny, low cost, low power and multifunctional sensor nodes where each sensor node has very low battery life. Main goal is to conserve the transmitted energy from various...

Various Aspects of Minutia As a Fingerprint Feature

Biometrics is one of the biggest tendencies in human identification. The fingerprint is the most widely used biometric. Extracting minutiae from fingerprint images is one of the most important steps in automatic fingerpr...

Analysis of Primes Less Than a Trillion

An exhaustive analysis of the highly irregularly distributed prime numbers in the range of 1 to 1 trillion is presented in this work. Since we widely use the decimal number system, the distribution trends of the primes i...

Download PDF file
  • EP ID EP87375
  • DOI -
  • Views 174
  • Downloads 0

How To Cite

Dibyendu Barman, Iti Sarkar (2013). Dynamic Time Quantum in Shortest Job First Scheduling Algorithm (DTQSJF) for Unpredictable Burst Time of Processes. International Journal of Computer Science & Engineering Technology, 4(3), 208-212. https://europub.co.uk/articles/-A-87375