Dynamic Time Quantum in Shortest Job First Scheduling Algorithm (DTQSJF) for Unpredictable Burst Time of Processes
Journal Title: International Journal of Computer Science & Engineering Technology - Year 2013, Vol 4, Issue 3
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
- EP ID EP87375
- DOI -
- Views 196
- Downloads 0
Quantum computation and Schizophrenia
Microtubules in the brain have been associated with quantum computation and consciousness. The microtubules have been reorted to be affected in schizophrenia. Schizophrenia is also associated with hallucinations (auditor...
Modified Reliable Energy Aware Routing Protocol For Wireless Sensor Network
In this paper, a novel reliable energy aware routing protocol is proposed, which is based on reliability and energy efficiency. Since in the wireless environment, link quality is difficult to guarantee, the reliable rout...
Ontology Based Semantic Web Service Discovery and Composition Framework
Web Service Discovery is the process of finding a suitable Web Service for a given task. A theoretical analysis of ontology-based service composition is proposed in terms of its dependency with service discovery. Web Ser...
Multi-Authentication for Cloud Security: A Framework
Cloud computing is a multi-tenant computational paradigm that offers an efficient, elastic and scalable business model for organizations to adopt various information technology (IT) resources i.e. software, hardware, net...
Two Stage Robust Filtering Technique to Remove Salt & Pepper Noise in Grayscale Image
Digital images are playing a key role but while transmitting the image more disturbances are produced by the noise which corrupts the image. Denoising leads to good quality image and restoration of original information....