CFP last date
20 June 2024
Reseach Article

A 2LFQ Scheduling with Dynamic Time Quantum using Mean Average

by Rakesh K. Lenka, Prabhat Ranjan
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 47 - Number 23
Year of Publication: 2012
Authors: Rakesh K. Lenka, Prabhat Ranjan
10.5120/7495-0560

Rakesh K. Lenka, Prabhat Ranjan . A 2LFQ Scheduling with Dynamic Time Quantum using Mean Average. International Journal of Computer Applications. 47, 23 ( June 2012), 15-19. DOI=10.5120/7495-0560

@article{ 10.5120/7495-0560,
author = { Rakesh K. Lenka, Prabhat Ranjan },
title = { A 2LFQ Scheduling with Dynamic Time Quantum using Mean Average },
journal = { International Journal of Computer Applications },
issue_date = { June 2012 },
volume = { 47 },
number = { 23 },
month = { June },
year = { 2012 },
issn = { 0975-8887 },
pages = { 15-19 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume47/number23/7495-0560/ },
doi = { 10.5120/7495-0560 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:42:36.857011+05:30
%A Rakesh K. Lenka
%A Prabhat Ranjan
%T A 2LFQ Scheduling with Dynamic Time Quantum using Mean Average
%J International Journal of Computer Applications
%@ 0975-8887
%V 47
%N 23
%P 15-19
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The efficiency and performance of multitasking operating systems essentially depends on the nature of CPU scheduling algorithm. There are many algorithms available for CPU scheduling. Each having its own deficiency and limitations. One of the most well-known approaches for scheduling is the Multi-level Feedback Queue (MLFQ). The MLFQ tries to work in a two-fold manner. First, it tries to optimize turnaround time as it is done by running shorter jobs first. Unfortunately, the OS doesn't generally have the knowledge that how long a job will run for, exactly the knowledge that algorithms like SJF (or SRTF) require. Second, MLFQ attempts to make a system feel responsive to interactive users (i. e. users sitting and staring at the screen, waiting for a process to finish), and thus minimize response time. Well-known algorithms like Round Robin also reduce response time but are less suitable for turnaround time. In this paper, we proposed a new approach for feedback scheduling algorithm which helps to improve the efficiency of CPU. The paper presents an approach called dynamic-time-quantum 2LFQ (Two-level Feedback Queue) scheduling. The idea is to make the operating systems adjusts the time quantum according to the burst time of set of waiting processes in the ready queue.

References
  1. Silberschatz, A. , P. B. Galvin and G. Gagne, 2004, "Operating Systems Concepts", 7th Edn. , John Wiley and Sons, USA. , ISBN: 13: 978-0471694663, pp. 944.
  2. Tanebaun, A. S. , 2008, "Modern Operating Systems", 3rd Edn. , Prentice Hall, ISBN: 13: 9780136006633, pp. 1104.
  3. Rakesh Mohanty, H. S. Behera, Debashree Nayak,"A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis", International Journal of Computer Applications (0975 – 8887), Volume 5– No. 5, 2010.
  4. Rami J. Matarneh, "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.
  5. Ajit. Singh, P. Goyal, S. Batra, "An Optimized Round Robin Scheduling Algorithm, for CPU Scheduling", IJCSE, Vol. 02, No. 07, 2010.
  6. Rami J. Matarneh, "Self-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of the Now Running Processes", American Journal of Applied Sciences, Vol 6, No. 10, 2009.
  7. Becchetti, L. , Leonardi, S. and Marchetti S. A. (2006), "Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm" Mathematics of Operation Research Vol. 31, No. 1, February, pp. 85–108.
  8. Rakesh Mohanty, H. S. Beheram Khusbu Patwarim Monisha Dash, M. Lakshmi Prasanna , "Priority Based Dynamic Round Robin (PBDRR) Algorithm with Intelligent Time Slice for Soft Real Time Systems", (IJACSA) International Journal of Advanced Computer Science and Applications, Vol. 2, No. 2, February 2011.
  9. Rakesh Mohanty, H. S. Behera, Khusbu Patwari, Monisha Dash, "Design and Performance Evaluation of a New Proposed Shortest Remaining Burst Round Robin (SRBRR) Scheduling Algorithm", In Proceedings of International Symposium on Computer Engineering & Technology (ISCET), Vol 17, 2010.
  10. Basney, Jim and Livny, Miron (2000), "Managing Network Resources in Condor", 9th IEEE Proceedings of the International Symposium on High Performance Distributed Computing, Washington, DC, USA.
  11. Rakesh Mohanty, H. S. Behera, Debashree Nayak, "A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis", International Journal of Computer Applications (0975 – 8887), Volume 5– No. 5, August 2010.
  12. Helmy, T. and A. Dekdouk, Burst round robin as a proportional-share scheduling algorithm. IEEEGCC, King Fahed University, 2007. http://eprints. kfupm. edu. sa/1462.
Index Terms

Computer Science
Information Sciences

Keywords

Cpu Scheduling Dynamic-time-quantum Scheduling Algorithm