Analisis Penjadwalan Proses Pada Sistem Operasi Untuk Efisiensi Prosesor
Main Article Content
Juniar Cicilia Sitohang
Endang Pramita Nainggolan
Ekha Gabena Siahaan
Indra Gunawan
Penjadwalan proses merupakan salah satu fungsi penting dalam sistem operasi karena menentukan urutan proses dalam memperoleh akses terhadap prosesor. Pemilihan algoritma penjadwalan yang kurang tepat dapat meningkatkan waktu tunggu dan waktu penyelesaian sehingga menurunkan efisiensi pemrosesan. Penelitian ini bertujuan menganalisis dan membandingkan kinerja algoritma First Come First Served (FCFS), Shortest Job First (SJF), Priority Scheduling, dan Round Robin dalam penjadwalan proses. Metode penelitian menggunakan pendekatan eksperimen berbasis simulasi dengan enam proses yang memiliki variasi waktu kedatangan, waktu eksekusi, dan prioritas. Evaluasi dilakukan berdasarkan Average Waiting Time, Average Turnaround Time, dan Response Time. Hasil simulasi menunjukkan bahwa SJF menghasilkan Average Waiting Time terendah sebesar 9,17 satuan waktu dan Average Turnaround Time sebesar 13,83 satuan waktu. FCFS menghasilkan Average Waiting Time 10,00 dan Average Turnaround Time 14,67, sedangkan Priority Scheduling menghasilkan masing-masing 11,67 dan 16,33. Round Robin dengan time quantum 3 menghasilkan Average Waiting Time 13,17 dan Average Turnaround Time 17,83. Berdasarkan skenario penelitian, SJF memberikan efisiensi waktu terbaik, sedangkan Round Robin lebih menekankan pemerataan akses prosesor.
Al Ghifari, A., & Siregar, H. (2025). Systematic literature review: Perbandingan kinerja algoritma penjadwalan CPU FCFS, SJF, Round Robin, dan Priority. Jurnal Ilmiah Sistem Informasi dan Ilmu Komputer, 5(2), 530–548. https://doi.org/10.55606/juisik.v5i2.1404
Barman, D., Paul, B., Bhattacharya, S., De, S., & Arya, G. P. (2024). Optimized Round Robin CPU scheduling for critical processes. Global Journal of Computer Science and Technology, 23(H3), 13–18.
González-Rodríguez, M., Otero-Cerdeira, L., González-Rufino, E., & Rodríguez-Martínez, F. J. (2024). Study and evaluation of CPU scheduling algorithms. Heliyon, 10(9), e29959. https://doi.org/10.1016/j.heliyon.2024.e29959
Hajjar, O., Mekhallalati, E., Annwty, N., Alghayadh, F., et al. (2024). Performance assessment of CPU scheduling algorithms: A scenario-based approach with FCFS, RR, and SJF. Journal of Computer Science, 20(9), 972–985. https://doi.org/10.3844/jcssp.2024.972.985
Hussein, S. A., & Abdul Kareem, E. I. (2024). A proposed CPU job-scheduling technique based on Round Robin method using dual synchronized time-slices. Ingénierie des Systèmes d’Information, 29(5), 1847–1858. https://doi.org/10.18280/isi.290517
Indra, Z., Zidan, A. A., Silaen, A. A., Habibi, A. N., & Sitepu, K. P. (2025). Analisis komparatif dan evaluatif terhadap algoritma First-Come First-Served (FCFS) dalam penjadwalan CPU di era komputasi modern. Jurnal Penelitian Inovatif, 5(4), 3197–3206. https://doi.org/10.54082/jupin.1957
Pan, W. (2024). Comparison and analysis of scheduling algorithms: Exploring performance, time, fairness, and applicable scenarios. Highlights in Science, Engineering and Technology, 120, 1–7. https://doi.org/10.54097/4asdtt07
Pemasinghe, S., & Rajapaksha, S. (2022). Comparison of CPU scheduling algorithms: FCFS, SJF, SRTF, Round Robin, priority based, and multilevel queuing. In 2022 IEEE 10th Region 10 Humanitarian Technology Conference (R10-HTC) (pp. 318–323). IEEE. https://doi.org/10.1109/R10-HTC54060.2022.9929533
Purnomo, R., & Putra, T. D. (2023). Comparative study: Preemptive Shortest Job First and Round Robin algorithms. Sinkron: Jurnal dan Penelitian Teknik Informatika, 8(2). https://doi.org/10.33395/sinkron.v8i2.12525
Putra, T. D., & Purnomo, R. (2024). Simulation and modelling of pre-emptive Priority CPU Scheduling Algorithm. Sinkron: Jurnal dan Penelitian Teknik Informatika, 8(3), 1631–1640. https://doi.org/10.33395/sinkron.v9i3.13352
Rachmad, A., Sonata, F., & Hutagalung, J. (2023). Analysis average waiting time search performance in the queue process on CPU scheduling using the Round Robin, shortest job first and first in first out algorithm. AIP Conference Proceedings, 2679, 020010. https://doi.org/10.1063/5.0111352
Rizal, A., & Hasibuan, N. (2022). Implementasi penjadwalan CPU menggunakan algoritma First Come First Served (FCFS). InfoTekJar: Jurnal Nasional Informatika dan Teknologi Jaringan, 7(1). https://doi.org/10.30743/infotekjar.v7i1.9638
Sidiq, W. A. B., Gani, E. U., Djuniadi, & Ardhiansyah, A. (2026). Analisis komparatif efisiensi algoritma CPU scheduling (FCFS, Round Robin, dan Priority) berbasis simulasi pada lingkungan OS Simulator. Elkom: Jurnal Elektronika dan Komputer, 19(1). https://doi.org/10.51903/elkom.v19i1.3403
Syauqi, H. A., & Siregar, H. (2025). Systematic literature review (SLR): Dampak modifikasi algoritma Round-Robin dalam penjadwalan CPU pada sistem operasi. Digital Transformation Technology, 5(1), 368–374. https://doi.org/10.47709/digitech.v5i1.6171
Tufegdžić, M., Jevremović, V., & Petrović, Z. (2022). Estimation of CPU scheduling algorithms efficiency using object oriented programming. In 9th International Scientific Conference Technics and Informatics in Education. https://doi.org/10.46793/TIE22.182T
