CFP last date
22 April 2024
Reseach Article

A New Approach to CPU Scheduling Algorithm: Genetic Round Robin

by Maria Ulfah Siregar
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 47 - Number 19
Year of Publication: 2012
Authors: Maria Ulfah Siregar
10.5120/7296-0459

Maria Ulfah Siregar . A New Approach to CPU Scheduling Algorithm: Genetic Round Robin. International Journal of Computer Applications. 47, 19 ( June 2012), 18-25. DOI=10.5120/7296-0459

@article{ 10.5120/7296-0459,
author = { Maria Ulfah Siregar },
title = { A New Approach to CPU Scheduling Algorithm: Genetic Round Robin },
journal = { International Journal of Computer Applications },
issue_date = { June 2012 },
volume = { 47 },
number = { 19 },
month = { June },
year = { 2012 },
issn = { 0975-8887 },
pages = { 18-25 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume47/number19/7296-0459/ },
doi = { 10.5120/7296-0459 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:42:18.115816+05:30
%A Maria Ulfah Siregar
%T A New Approach to CPU Scheduling Algorithm: Genetic Round Robin
%J International Journal of Computer Applications
%@ 0975-8887
%V 47
%N 19
%P 18-25
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

CPU scheduling should preserve fairness and avoid processes from do not ever obtain CPU. Modern operating system era faces multitasking on computer operational environment. If CPU scheduling is efficient, high computation could be done correctly and system could be retained stable. One criterion that must be achieved by scheduling algorithm is minimization average waiting time for a set of processes in gaining CPU allocation. There are several algorithms for CPU scheduling; one of them is Round Robin. Round Robin supplies quantum that is same for each of processes. However, there is no standard for quantum. Inevitably, if quantum is very high, response/waiting time for each process could be high, and otherwise, there is an increasing CPU overhead for context switching. This research concerns with improving Round Robin performance. Our approach is to combine Round Robin with Genetic algorithm. In this approach, an individual is a quantum that will be iterated for achieving best quantum that will produce minimal average waiting time. We use integer number for representing a chromosome with length three. Furthermore, we use roulette wheel method for parent selection and steady state replacement technique for survival selection. By using one point crossover and flip mutation, this approach can result better average waiting time than that were found in references used.

References
  1. Noon, A. K. 2011. A new Round Robin based scheduling algorithm for operating systems: Dynamic quantum using the mean average. International Journal of Computer Science Issues, 224-229.
  2. Trivedi, J. A. and Sajja, P. S. 2011. Improving efficiency of Round Robin scheduling using Neuro Fuzzy approach. International Journal of Research and Reviews in Computer Science. 2: 308-311. .
  3. Sugiantoro, B. 2010. Handout for Operating System's Lecture. Yogyakarta: Handout's lecture of Informatics Department, Faculty of Science and Technology, State Islamic University Sunan Kalijaga.
  4. Behera, H. S. , Curtis, S. and Panda, B. 2012. Enhancing the CPU Performance Using A Modified Mean-Deviation Round Robin Scheduling Algorithm for Real Time Systems. Journal of Global Research in Computer Science. 3: 9-17.
  5. Neshat, M. , Sargolzaei, M. , Najaran, A. and Adeli, A. 2012. The New Method of Adaptive CPU Scheduling Using Fonseca and Fleming's Genetic Algorithm. Journal of Theoretical and Applied Information Technology. 37: 1-16.
  6. Raheja, S. , Dhadich, R. and Rajpal, S. 2012. An Optimum Time Quantum Using Linguistic Synthesis for Round Robin CPU Scheduling Algorithm. International Journal on Soft Computing. 3: 57-66.
  7. Nayak, D. , Malla, S. K. and Debadarshini, D. 2012. Improved Round Robin Scheduling using Dynamic Time Quantum. International Journal of Computer Application. 38: 34-38.
  8. Panda, S. K. and Bhoi, S. K. 2012. An Effective Round Robin Algorithm using Min-Max Dispersion Measure. International Journal on Computer Science and Engineering. 4: 45-53.
  9. Dhakad, V. K. , Hiranwal, S. and Roy, K. C. 2011. Adaptive Round Robin scheduling using shortest burst approach based on smart time slice. International Journal of Computer Science and Communication. 2: 319-323.
  10. Mostafa, S. M. , Rida, S. Z. and Hamad, S. H. 2010. Finding time quantum of round robin CPU scheduling algorithm in general computing systems using integer programming. IJRRAS.
  11. Yadav, R. K. , Mishra, A. K. , Prakash, N. and Sharma, H. 2010. An improved Round Robin scheduling algorithm for CPU scheduling. International Journal on Computer Science and Engineering. 02: 1064-1066.
  12. Alam, B. , Doja, M. N. and Biswas, R. 2008. Finding time quantum of Round Robin CPU scheduling algorithm using Fuzzy Logic. ICCEE. 795-798.
  13. Eiben, A. E. & Smith, J. E. 2007. Introduction to Evolutionary Computing. Germany: Springer.
  14. Fadlisyah, Arnawan, and Faisal. 2009. Algoritma Genetika. Yogyakarta: Graha Ilmu. .
  15. Suyanto. 2008. Evolutionary Computation. Bandung: Informatika.
  16. Silberschatzs, A. , Galvin, P. B. , Gagne, G. 200 9. Operating System Concepts. Massachusetts: Addison Wesley.
Index Terms

Computer Science
Information Sciences

Keywords

Cpu Scheduling Round Robin Algorithm Genetic Algorithm