Mean-Difference Round Robin (MDRR) Algorithm with Dynamic Time Slice for Task Scheduling Using Real time applications
Journal: International Journal of Engineering Research (IJER) (Vol.5, No. 11)Publication Date: 2016-11-01
Authors : A.Gopi; R.Akhilesh Reddy;
Page : 867-870
Keywords : MDRR; CPU;
Abstract
Process scheduling means allocating a certain amount of CPU time to each of the user Processes. This paper proposes a CPU Scheduling algorithm, which is meant for optimizing CPU scheduling for real time applications. It is a new approach, which uses the concept of Mean Difference Round Robin (MDRR) with dynamic time quantum, whose value changes for each cycle. It acts better than RR and Mean Difference Round Robin (MDRR) Algorithm in terms of reducing the number of context switches, average waiting time and average turnaround time. The experimental results of the proposed algorithm have been compared with Mean- Difference Round Robin (MDRR) Algorithm is found to have produced optimum scheduling.
Other Latest Articles
- Multi-Objective Dispatch of Thermal System using Dragonfly Algorithm
- Microwave Radio Frequency Optimization and Link Performance
- A Fuzzy Model with Changing Deterioration Rate
- Liquefaction Potential Area Identification in Southern Bali Island Based on Ground Penetrating Radar, Geoelectricity and Borehole Data
- Liquefaction Potential Area Identification in Southern Bali Island Based on Ground Penetrating Radar, Geoelectricity and Borehole Data
Last modified: 2016-11-14 17:14:57