Design and Performance Evaluation of Smart Job First Dynamic Round Robin (SJFDRR) Scheduling Algorithm with Smart Time Quantum

Amit Kumar Gupta, Dr. Narendra Singh Yadav, Dr. Dinesh Goyal

Abstract


Round Robin scheduling is mostly used CPU scheduling algorithm; it gives better result in comparison to other scheduling algorithm. But this algorithm may lead many problems directly related to time quantum. If selected time quantum is large, then the response time of the processes may be too high. On the other hand, if time quantum is short, it increases the number of context switch which may lead overhead of the CPU. In this paper, we propose a new algorithm, called SJFDRR, based on a new approach called dynamic-time-quantum; the idea of this approach  is to make the CPU Scheduler arrange the process in ascending order on the burst time and assign the system priority and calculate a smart priority factor ‘SPF’ for each process. The process having the smallest ‘SPF’ value will be scheduled first. The time quantum is calculated dynamically. Based on the analysis, we show that the new proposed algorithm (SJFDRR) solves the fixed time quantum problem and increases the performance of Round Robin.


Keywords


Operating Systems; Multi Tasking; Scheduling Algorithm; Time Quantum; Round Robin.

Full Text:

PDF

References


D.M. Dhamdhere operating Systems A Concept Based Approach,Second edition, Tata McGraw-Hill, 2006.

Silberchatz, Galvin and Gagne, 2003. Operating systems concepts

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.

Ajit Singh, Priyanka Goyal, Sahil Batra “An Optimized Round Robin Scheduling Algorithm for CPU Scheduling” International Journal on Computer Science and Engineering Vol. 02, No. 07, 2010, 2383-2385

Rakesh Mohanty, Manas Das, M.Lakshmi Prasanna ,Sudhashree “Design and performance evaluation of a new proposed fittest job first dynamic round robin (FJFDRR)scheduling algorithm”International Journal of Computer Information System Vol. 2 No. 2,2011

Abbas Noon, Ali Kalakech, Seifedine Kadry “A New Round Robin Based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average” IJCSI International Journal of Computer Science Issues, Vol. 8, Issue 3, No. 1, May 2011

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.

Debashree Nayak,Sanjeev Kumar malla, Debashree Debadarshini “Improved Round Robin Scheduling using Dynamic Time Quantum” International Journal of computer Application (1975-8875) Volume 38-No. 5,January 2012.

Rakesh Mohanty ,H.S. Behara,Khusbu Tiwari , Manas Das, M.Lakshmi Prasanna “Priority Based dynamic Round Robin(PBDRR) Algorithm with Intelligent Time Slice for Soft Real Time System” International Journal of Advanced Computer Science and Application Vol. 2 No. 2, February ,2011.

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.

H. S. Behera and et. al. A New Dynamic Round Robin and SRTN Algorithm with Variable Original Time Slice and Intelligent Time Slice for Soft Real Time Systems. International Journal of Computer Applications 16(1):54–60, February 2011.

H. S. Behera, Rakesh Mohanty, Sabyasachi Sahu, Sourav Kumar Bhoi. Design and Performance Evaluation of Multi Cyclic Round Robin(MCCR) Algorithm using Dynamic Time Quantum, Journal of Global Research in Computer Science, ISSN 2229-371X, Vol.2, No. 2, pp 48-53, February, 2011.

H. S. Behera, Rakesh Mohanty, Jajnaseni Panda, Dipanwita Thakur Subasini Sahu, Experimental Analysis of A New Fair Share Wighted Time Slice(FSWTS) Scheduling Algorithm for Real Time Systems, Journal of Global Research in Computer Science, ISSN 2229-371X, Vol.2, No. 2, pp 54-60, February, 2011.

Mohammed A. F. Al-Husain, Best-Job-first CPU Scheduling Algorithm, Information Technology Journal 6 (2):288-293, 2007. pp: 1104, 2008.

Manish Kumar Mishra, Abdul Kadir Khan, “An Improved Round Robin CPU Scheduling Algorithm (IRR)” Journal of Global Research in Computer Science Vol. 6 No. 3,June 2012

Dr. R. Rama Kishore, Arpana Saxena “An Efficient Multi Parametric CPU Scheduling Algorithm for Single Processor Systems” International Journal of Computer Science & Engineering Technology (IJCSET) Vol. 5 No. 5, May 2014.

Manish Kumar Mishra, Dr. Faizur Rashid, “An Improved Round Robin Scheduling Algorithm with Varying Time Quantum” International Journal of Computer Science, Engineering and Applications (IJCSEA) Vol.4, No.4, August 2014.

M. Ramakrishna, G.Pattabhi Rama Rao, “Efficient Round Robin CPU Scheduling Algorithm for Operating Systems”, International Journal of Innovative Technology And Research Volume No. 1, Issue No. 1, December-January 2013, 103-109.

Abdulzaraq Abdulrahim, Salisu Aliyu, Ahmad M Mustapha, Saleh E Abdullahi, “An Additional Improvement in Round Robin (AAIRR) CPU Scheduling Algorithm”, International Journal of Advanced Research in Computer Science and Software Engineering, Volume 4, Issue 2, February 2014.

Rahul Joshi, Sashi Bhushan Tyagi, “Smart Optimized Round Robin (SORR) CPU Scheduling Algorithm”, International Journal of Advanced Research in Computer Science and Software Engineering, Volume 5, Issue 7, July 2015.

Muhammad Akhtar, Bushra Hamid1, Inayat ur-Rehman, Mamoona Humayun, Maryam Hamayun and Hira Khurshid, “An Optimized Shortest job first Scheduling Algorithm for CPU Scheduling”, Journal of Applied Environmental and Biological Sciences, ISSN: 2090-4274, 2015.


Refbacks

  • There are currently no refbacks.


 
  
 

 

  


About ASRJETS | Privacy PolicyTerms & Conditions | Contact Us | DisclaimerFAQs 

ASRJETS is published by (GSSRR).