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 175
- Downloads 0
A review of Coupling and Cohesion metrics in Object Oriented Environment
Software metrics are used to check and evaluate various aspects of the complexity of a software product. Coupling and Cohesion are considered to be the most important attributes. The increasing need for software quality...
CHEQUE CLEARANCE SYSTEM USING VARIOUS VALIDATION TECHNIQUES
Processing cheques manually is been done for decades and more efficient systems are still under research. In this entire processing system, providing a secured transaction with efficient verification is what more importa...
A NEW VLSI ARCHITECTURE OF PARALLEL MULTIPLIER BASED ON RADIX-4 MODIFIED BOOTH ALGORITHM USING VHDL
Low power consumption and smaller area are some of the most important criteria for the fabrication of DSP systems and high performance systems. Optimizing the speed and area of the multiplier is a major design issue. How...
Implementation of Multicloud Computing Deployment System of SAAS & IAAS for Effective Resource Utilization on MTC Application
Cloud computing is gaining acceptance in several IT organizations. In this paper, we have a tendency to explore this state of affairs to deploy a computing cluster on the highest of a multi cloud infrastructure, for reso...
A HYBRID APPROACH FOR CLUSTERING BASED ON COMBINATIONAL ALGORITHMS
Data clustering helps one discern the structure of and simplify the complexity of massive quantities of data. It is a common technique for statistical data analysis and is used in many fields, including machine learning,...