Analisis Perbandingan Penjadwalan Proses Menggunakan Algoritma Round Robin dan Priority Preemptive
Abstract
An algorithm is a sequence of steps that have been arranged in an orderly manner to solve a particular problem. To plan an algorithm, something called pseudocode has been used, which is similar to a program code. One of the algorithms that is often used is Round Robin, which has divided processor time fairly between various running processes. On the other hand, there is also a scheduling method using the Priority Preemptive method. In this research, the application of algorithms that have been able to increase efficiency and effectiveness in managing various processes has been discussed. The selection of the right scheduling algorithm has depended on the needs and characteristics of the system that has been used. The Round Robin algorithm has been suitable for systems that prioritize fairness and equality of process time. While the Priority Preemptive algorithm has been more suitable for systems that require fast handling with high priority. In Round Robin scheduling, an Average Waiting Time of 14.6 and an Average Turn Around Time of 22.8 have been obtained. While in Priority Preemptive scheduling, an Average Waiting Time of 10.6 and an Average Turn Around Time of 18.8 have been obtained.
Keywords: Algorithms; Pseudocode; Round robin; Priority scheduling
Abstrak
Algoritma merupakan serangkaian langkah-langkah yang telah disusun secara teratur untuk menyelesaikan suatu masalah tertentu. Untuk merencanakan suatu algoritma digunakanlah pseudocode yang merupakan kode program. Salah satu algoritma yang sering digunakan adalah Round Robin yang membagi waktu prosesor secara adil pada berbagai proses yang sedang berjalan. Di sisi lain, terdapat pula metode penjadwalan dengan menggunakan metode Priority Preemptive. Pada penelitian ini dibahas mengenai penerapan algoritma yang mampu meningkatkan efisiensi dan efektivitas dalam mengelola berbagai proses. Pemilihan algoritma penjadwalan yang tepat bergantung pada kebutuhan dan karakteristik sistem yang digunakan. Algoritma Round Robin cocok digunakan untuk sistem yang mengutamakan kewajaran dan kesetaraan waktu proses. Sedangkan algoritma Priority Preemptive lebih cocok digunakan untuk sistem yang membutuhkan penanganan cepat dengan prioritas tinggi. Pada penjadwalan Round Robin diperoleh Average Waiting Time sebesar 14,6 dan Average Turn Around Time sebesar 22,8. Sementara pada penjadwalan Prioritas Preemptif, Waktu Tunggu Rata-rata 10,6 dan Waktu Penyelesaian Rata-rata 18,8 telah diperoleh.
Kata kunci: Algoritma; Pseudocode; Round robin; Penjadwalan priority
References
Khairunnisa dan N. Wulan, Perancangan Intelligent Tutoring System Sebagai Upaya Inovatif Pada Pembelajaran Algoritma dan Struktur Data, ALGORITMA: Jurnal Ilmu Komputer dan Informatika, Vol. 4, No. 2, pp. 34-42, 2020
S. Akgun dan C. Greenhow, Artificial Intelligence (AI) in Education: Addressing Societal and Ethical Challenges in K-12 Settings, AI and Ethics, Vol. 2, No. 3, pp. 431-440, 2022, https://doi.org/10.1007/s43681-021-00096-7
I. Tarsini dan R. Anggraeni, Explore flowchart and pseudocode concepts in algorithms and programming, Indonesian Journal of Multidisciplinary Science, Vol. 3, No. 5, pp. 1-8, 2024
J. Blazewicz, K.H. Ecker, E. Pesch, G. Schmidt, dan J. Weglarz, Scheduling Computer and Manufacturing Processes, 2nd Edition, Kindle Edition, Springer, June 29, 2013
G. Lumbantoruan, 2016, Modifikasi Algoritma Round Robin dengan Dynamic Quantum Time dan Pengurutan Proses Secara Ascending, Journal Information System Development (ISD), Vol. 2, No. 2, pp. 44-55, 2016
A.A. Alsheikhy, R.A. Ammar, dan R.S. Elfouly, An improved dynamic Round Robin scheduling algorithm based on a variant quantum time, 2015 11th International Computer Engineering Conference (ICENCO), Cairo, Egypt, 29-30 December 2015, pp. 98-104, 2015
K.O. Hoger, H.J. Kamal dan F.H. Shalau, Comparative Analysis of The Essential CPU Scheduling Algorithms, Bulletin of Electrical Engineering and Informatics, Vol. 10, No. 5, pp. 2742-2750, 2021
T.D. Putra dan R. Purnomo, Simulation of Priority Round-Robin Scheduling Algorithm, Sinkron : Jurnal dan Penelitian Teknik Informatika, Vol. 6, No. 4, pp. 2170-2181, 2022
L.H. Karteri dan A. Shehu, Preemptive and Non Preemptive Priority Scheduling, International Journal of Computer Science & Management Studies, Vol. 19, No. 1. p. 1, 2015
T.D. Putra, Analysis of Priority Preemptive Scheduling Algorithm: Case Study, International Journal of Advanced Research in Computer and Communication Engineering, Vol. 11, No. 1, pp. 27-30, 2022
A.M. Simarmata dan M. Harahap, Sistem Penjadwalan Iklan Menggunakan Metode Priority Schedulling pada PT. Kidung Indah Selaras Suara (Radio Kiss FM) untuk Efektivitas dan Efisiensi Produksi Siaran, Jurnal Penelitian Teknik Informatika Universitas Prima Indonesia (UNPRI) Medan, Vol. 2, No. 1, pp. 337-347, 2019
Sakshi, C. Sharma, S. Sharma, S. Kautish, S.A.M. Alsallami, E.M. Khalil, dan A.W. Mohamed, A new median-average round Robin scheduling algorithm: An optimal approach for reducing turnaround and waiting time, Alexandria Engineering Journal, Vol. 61, No. 12, pp. 10527-10538, 2022, https://doi.org/10.1016/j.aej.2022.04.006
C. Effendy dan G. Gusrianty, Application of Round Robin in Scheduling in Web-Based Wedding Organizers, Journal of Applied Business and Technology, Vol. 5, No. 2, pp. 90-95, 2024
A.A. Rohmah dan D. Gunawan, Implementasi Algoritma Priority Scheduling Sistem Informasi Pelayanan Administrasi Kependudukan Desa, Jurnal Informatika: Jurnal pengembangan IT (JPIT), Vol. 8, No. 3, pp. 181-187, 2023
S. Eje, L. Ochei, dan C.B. Marcus, Clinical Surgery Scheduling System: A Novel Approach to Enhancing Hospital Efficiency Using Priority Algorithms, The International Journal of Engineering and Science (IJES), Vol. 13, No. 2, pp. 26-53, 2024
A. Wijaya dan Gunawan, Implementasi Algoritma Round Robin Pada Sistem Penjadwalan Mata Kuliah (Studi Kasus: Universitas Muhammadiyah Bengkulu), JURNAL INFORMATIKA UPGRIS, Vol. 4, No. 1, pp. 64-71,2018
R. Setyawati dan A.B. Maulachela, Penerapan Algoritma Dynamic Priority Scheduling pada Antrian Pencucian Mobil, JTIM : Jurnal Teknologi Informasi Dan Multimedia, Vol. 2, No. 1, pp. 29–35, 2020, https://doi.org/10.35746/jtim.v2i1.85
A. Abdulrahim, S.E. Abdullahi, dan J.B. Salahu, A New Improved Round Robin (NIRR) CPU Scheduling Algorithm, International Journal of Computer Aplication, Vol. 90, No. 4, pp. 27-33, 2014
Indrajani, Pengantar Sistem Basis Data Case Study All In One, Elex Media Komputindo, Jakarta, ISBN 978-602-02-4903-2, 2014
How To Cite This :
Refbacks
- There are currently no refbacks.
