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

Preventing mitm attack in simple secure pairing in Bluetooth

Secure simple pairing has been adopted by Bluetooth version “Bluetooth 2.1+EDR(ENHANCED DATA RATE).It should be noted that for establishing Bluetooth connection that uses Diffie hellman public cryptography in its commu...

A Review on the Factors that have Driven E-Commerce in Modern Day Business

E-Commerce has advanced quickly in a very short span and is changing the face of business. It deals with carrying out business transactions with the aid of Internet through linked computer systems of host, buyer and the...

Speaker Independent Isolated Tamil Words Recognition System using Different Classifiers 

The paper is to build a speaker independent isolated speech recognition system for Tamil Language. The system consists of four steps: first step involves recording of Tamil spoken words using high quality studio micropho...

BLOCKING ARTIFACT DETECTION METHOD FOR HIGHLY COMPRESSED IMAGES

Blocking artifacts severely reduce the visual quality of the image making it unpleasant to the viewer. Reduction of blocking artifacts is essential to render the compressed image or video acceptable to the human viewer....

Image Encryption and Decryption Using Selective Block Encryption Technique

In the recent world, the need of information security has became a necessity with the progress in data exchange and communication by electronic system. Because of the growth of multimedia application, security becomes an...

Download PDF file
  • EP ID EP87375
  • DOI -
  • Views 191
  • 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