Analisis Average Waiting Time Penjadwalan CPU Menggunakan Algoritma Shortest Remaining First dan Algoritma Round Robin

Authors

  • Ronald Belferik Universitas Pelita Harapan
  • Evander Banjarnahor Universitas Pelita Harapan

DOI:

https://doi.org/10.54259/jdmis.v3i1.4076

Keywords:

Shortest Remaining First, Round Robin, Average Waiting Time

Abstract

In operating systems, process scheduling is a critical aspect to determine the order of process execution by the CPU. This research compares the average waiting time (AWT) of Shortest Remaining First (SRF) algorithm and Round Robin (RR) algorithm where the problem to be solved is CPU scheduling. The purpose of this research is to get an algorithm that has a short average waiting time. The test results obtained that the SRF algorithm has a very short average waiting time with a value of 29.85 ms compared to the RR algorithm which gets an AWT result of 65.6 ms.

Downloads

Download data is not yet available.

References

P. Tri Dharma, P. Rakhmat, “Analisis Algoritma Round Robin pada Penjadwalan CPU”, Jurnal Ilmiah Teknologi Informasi Asia, Vol. 15, No. 2 Tahun 2021.

N. Nuraini and I. Ahmad, “Sistem Informasi Manajemen Kepegawaian Menggunakan Metode Key Performance Indicator Untuk Rekomendasi Kenaikan Jabatan (Studi Kasus: Kejaksaan Tinggi Lampung),”J. Teknol. dan Sist. Inf., vol. 2, no. 3, p. 81, 2021.

I. Tasya Fitria., “Analisis Performa Algoritma Penjadwalan CPU Dalam Sistem Operasi Komputer Untuk Pengoptimalan Responsivitas”, Jurnal Teknologi Pintar, Vol. 3, November 2023.

O. Hoger K, J. Kamal H, H. Shalau F, Comperative, “Comparative Analysis of The Essential CPU Scheduling Algorithms”, Journal Bulletin of Electrical Engineering and Informatics, Vol. 10, No. 5, PP. 2742-2750, October 2021.

P. Rakhmat, P. Tri Dharma, “Median-Average Round Robin (MARR) Algorithm for Optimal CPU Task Scheduling”, Jurnal dan Penelitian Teknik Informatika (Sinkron), Vol. 9, No. 1, January 2025.

S. Siti, S. M Yogie, Rismayanti, “Penerapan Algoritma Shortest Job First (SJF) dan Priority Scheduling (PS) pada Maintanance Mesin ATM, Jurnal UINSU, Vol. 07, No. 1, April 2023.

M. Mr. Rohit, Operating System, EduGorilla Prep Experts.

H. Richki, Arsitektur dan Organisasi Komputer, Ponorogo : Uwais Inspirasi Indonesia, 2021.

A. Kande, dkk, Introduction to Operating Systems, India : Nitya Publications, 2020.

A. Mahdi S, A. Firas Sabah, M. Tariq A, “Reducing Waiting and Idle Time for A Group of Jobs in The Grid Computing”, Journal Bulleting of Electrical Engineering and Informatics, Vol. 12, No. 5, PP. 3115-3123, October 2023.

N. Ahmad Mursyidun, dkk Kernel System, Malang : Ahlimedia Press, 2021.

J. Sandeep, “Shortest Remaining Time First (Preemptive SJF) Scheduling Algorithm“, 03 Februari 2025, [Online]. Tersedia : https://www.geeksforgeeks.org/shortest-remaining-time-first-preemptive-sjf-scheduling-algorithm [Diakses : 25 Februari 2025].

S. Agung, J. Erfian, “Sistem Penjadwalan Produksi Makanan Sei Menggunakan Algoritma Round Robin di CV Gyumbox, eProsiding Teknik Informatika (PROTEKTIF), Juni 2021, Vol. 2, No. 1.

T. Raj Gaurang, A. Ambuj Kumar, K. Vikas, S. Durgesh, Design Concepts of Operating System, Delhi : Namya Press.Com, 2021.

W. Wisnu, M. Desinta, A. Kezia Jazzlyn, “Implementasi Algoritma Round Robin dan Priority Pada Sistem Antrian Rumah Sakit”, Jurnal Fasilkom, Vol 14, No. 2, PP. 507-513, Agustus 2024.

Downloads

Published

2025-02-25

How to Cite

Belferik, R., & Banjarnahor, E. (2025). Analisis Average Waiting Time Penjadwalan CPU Menggunakan Algoritma Shortest Remaining First dan Algoritma Round Robin. JDMIS: Journal of Data Mining and Information Systems, 3(1), 43–53. https://doi.org/10.54259/jdmis.v3i1.4076

Issue

Vol. 3 No. 1 (2025): February 2025

Section

Articles

License

Copyright (c) 2025 Ronald Belferik, Evander Banjarnahor

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors who publish with this journal agree to the following terms:

  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).