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

Stegocrypto - A Review Of Steganography Techniques Using Cryptography

The information security has become essential part of today’s world due to extensive use of internet. The privacy of secret data can be achieved with two classical methods of data security namely Cryptography and Stegano...

Multi Banking Transaction Interface Using MVC2 Architecture

BANKING SYSTEM PLAYS AN IMPORTANT ROLE IN EVERYONE’S LIFE. WITH THE GROWTH OF THE INTERNET WORLDWIDE THE WORLD HAS COME CLOSER AND CLOSER. SO, BANKS ARE ALSO PROVIDING NET BANKING WHICH PLAYS AN IMPORTANT ROLE IN ONE’S L...

Application for Retriving Details of Users - Topic Based Approach 

Basically students face problem in gathering materials and information about subjects. This application solves this problem by providing contact details of persons who are interested in particular area. So that, students...

Sign Language Recognition System to aid Deaf-dumb People Using PCA

The Sign Language is a method of communication for deaf-dumb people. Here vision based approach has been used. This paper presents design and implementation of real time Sign Language Recognition system to recognize 26 g...

AN EFFECEINT MULTI PARAMETERIC CPU SCHEDULING ALGORITHM FOR SINGLE PROCESSOR SYSTEMS

In today’s world, computing systems serve many purposes and imagining a world without them is a nightmare. From the very beginning of the evolution of computer systems, their performance has been a subject of intense int...

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