Penerapan Algoritma Genetika Dalam Memperolah Average Waiting Time Pada Penjadualan Round Robin
Keywords:
Round Robin, Genetic Algorithm
Abstract
The Average Waiting Time value in round robin scheduling is influenced by the quantum time value given randomly, so that the CPU scheduling
is not maximal. In this study, Genetic Algorithms are applied to determine the quantum time value in order to determine the minimum
Average Waiting Time value, so that the optimal solution is achieved in solving classic Round Robin scheduling problems. In this study the
application of Genetic Algorithms using parameter values consists of population: 2, number of generations: 2. In this study obtained AWT 12
milliseconds with fitness value 0.18388.
References
[1] Ahad, M. A. 2012. Modifying round robin algorithm for process scheduling using dynamic quantum precision. International Journal of Computer Aplicatioans on Issues and Challenges in Networking, Inteligence and Computing Technologies (ICNICT), pp. 5 -10.
[2] D’Souza, M., Caiero, F., dan Surlakar, S. 2012. Optimal round robin CPU scheduling algorithm using euclidean distance. Journal of Computer Applications Vol. 96(18): 8-11
[3] Kundargi, N. dan Bandekar, S.2013. CPU scheduling algorithm using dynamic time quantum for batch system. Internatioan Journal of latest Trends in Enginering and Technology. 82-84
[4] Mishra, M. K., dan Rashid. F, 2014. An improved round robin CPU scheduling algorithm with varying time quantum. International Journal of computer science, Enginering and Aplications. Vol. 4(4):1-8
[5] Kumar, R. 2012. Novel encoding scheme in genetic algorithms for better fitness. International Journal of Engineering and Advanced Technology (IJEAT). Vol.1(6) : 2249 – 8958.
[6] Silberschatz, A., Galvin. B. G., dan Gagn. G. 2012, Operating
Systems concepts, John Wiley and Sons. 9
Edition. Yale
Univeristy.
th
[2] D’Souza, M., Caiero, F., dan Surlakar, S. 2012. Optimal round robin CPU scheduling algorithm using euclidean distance. Journal of Computer Applications Vol. 96(18): 8-11
[3] Kundargi, N. dan Bandekar, S.2013. CPU scheduling algorithm using dynamic time quantum for batch system. Internatioan Journal of latest Trends in Enginering and Technology. 82-84
[4] Mishra, M. K., dan Rashid. F, 2014. An improved round robin CPU scheduling algorithm with varying time quantum. International Journal of computer science, Enginering and Aplications. Vol. 4(4):1-8
[5] Kumar, R. 2012. Novel encoding scheme in genetic algorithms for better fitness. International Journal of Engineering and Advanced Technology (IJEAT). Vol.1(6) : 2249 – 8958.
[6] Silberschatz, A., Galvin. B. G., dan Gagn. G. 2012, Operating
Systems concepts, John Wiley and Sons. 9
Edition. Yale
Univeristy.
th
Published
2018-07-30
How to Cite
Harni Seven Adinata, & Monang Juanda Tua Sihombing. (2018). Penerapan Algoritma Genetika Dalam Memperolah Average Waiting Time Pada Penjadualan Round Robin . JITA (Journal of Information Technology and Accounting), 1(2), 100-109. Retrieved from https://jurnal.uimedan.ac.id/index.php/JITA/article/view/993
Section
Articles
