Advertisement

Optimizing CPU Scheduling for Real Time Applications Using Mean-Difference Round Robin (MDRR) Algorithm

  • R. N. D. S. S Kiran
  • Polinati Vinod Babu
  • B. B. Murali Krishna
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 248)

Abstract

This paper proposes a novel approach called Mean-Difference Round Robin Algorithm, which is meant for optimizing CPU scheduling for real time applications. The proposed algorithm calculates the mean burst time of all the processes in the ready queue. Next, it finds out the difference between a process burst time and calculated mean burst time. This step is repeated for all the processes in the ready queue. Then, the proposed algorithm find out the process having the largest difference value and assigns it to CPU, and execute it for one time slice. Once the time slice of the process expires, the next process with the largest difference value is picked up from the ready queue and executed for one time slice. The process is repeated for all the processes in the ready queue. The experimental results of the proposed algorithm have been compared with other standard scheduling algorithms and the proposed Mean-Difference Round Robin Algorithm is found to have produced optimum scheduling.

Keywords

CPU Scheduler Burst Time Waiting Time Turnaround Time Gantt chart Pre-emptive Scheduling non Pre-emptive Scheduling Round Robin MDRR 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Silberschatz, A., Galvin, P.B., Gagne, G.: Operating system principles, 7th edn.Google Scholar
  2. 2.
    Shibu, K.: Introduction to Embedded Systems. THM (2009)Google Scholar
  3. 3.
    Dhamdhere, D.M.: Operating Systems A concept-based approach. Tata McGraw HillGoogle Scholar
  4. 4.
    Sinth, A., Goyal, P., Batra, S.: An optimized Round Robin Scheduling Algorithm for CPU Scheduling. IJCSE 02(07), 2383–2385 (2010)Google Scholar
  5. 5.
    Yaashuwanth, C., Ramesh, R.: A New Scheduling Algorithm. IJCSIS 6(2) (2009)Google Scholar
  6. 6.
    Noon, A., Kalakecch, A., Kadry, S.: A New Round Robin Based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average. IJCSI 8(3(1)) (May 2011)Google Scholar
  7. 7.
    Matarneh, R.J.: Self-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of the Now Running Processes. American Journal of Applied Sciences 6(10), 1831–1837 (2009) ISSN 1546-9239 Google Scholar
  8. 8.
    Hiranwal, S., Roy, K.C.: Adaptive Round Robin scheduling using shortest burst approach, based on smart time slice. International Journal of computer Science and Communication 2(2), 219–326 (2011)Google Scholar
  9. 9.
    Matarneh, R.J.: Self-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of the now Running Processes. American Journal of Applied Sciences 6(10), 1831–1837 (2009)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • R. N. D. S. S Kiran
    • 1
  • Polinati Vinod Babu
    • 1
  • B. B. Murali Krishna
    • 1
  1. 1.Swarnandhra College of Engineering and TechnologyNarsapurIndia

Personalised recommendations