Systematic Literature Review: Perbandingan Kinerja Algoritma Penjadwalan CPU FCFS, SJF, Round Robin, dan Priority
DOI:
https://doi.org/10.55606/juisik.v5i2.1404Keywords:
CPU Scheduling; Shortest Job First; Round Robin; Throughput; Waiting Time; Adaptive SchedulingAbstract
Efficient CPU scheduling is essential to reduce waiting time, turnaround time, and maximize throughput. This study conducts a Systematic Literature Review (SLR) to compare FCFS, SJF, RR, and Priority Scheduling based on these metrics (RQ1), and to examine trade-offs between fairness and efficiency across different workload contexts (RQ2). Using the PRISMA method, 7 articles from 2015–2025 were selected from Scopus. Data were synthesized on scheduling performance, and VOSviewer was used for bibliometric mapping. Results show SJF excels in batch environments with lowest waiting (≈15 ms) and turnaround times (≈30 ms). Adaptive RR variants provide high throughput (up to 1200 jobs/s) and low latency in real-time, at a cost of increased context-switch overhead (5–12%). FCFS, although simple, results in high delays. Hybrid algorithms offer a balance between fairness and performance. Bibliometric analysis confirmed dominant research clusters on SJF and RR adaptations.
References
Abeni, Luca. (2024). Virtualized real-time workloads in containers and virtual machines. Journal of Systems Architecture, 154, 103238.
Abu-Dalbouh, Hussain Mohammad. (2022). A new combination approach to cpu scheduling based on priority and round-robin algorithms for assigning a priority to a process and eliminating starvation. International Journal of Advanced Computer Science and Applications, 13(4).
Al-Bakhrani, Ali A., Hagar, Abdulnaser A., Hamoud, Ahmed A., & Kawathekar, Seema. (2020). Comparative analysis of cpu scheduling algorithms: Simulation and its applications. International Journal of Advanced Science and Technology, 29(3), 483 – 494. Retrieved from https://www.scopus.com/inward/record.uri?eid=2-s2.0-85081187633&partnerID=40&md5=6530177bb5784d5ece63de3fb2f036cd
Khan, Zafar Iqbal, Khan, Muzafar, & Shah, Syed Nasir Mehmood. (2025). Agent-based Adaptive Dynamic Round Robin (AADRR) Scheduling Algorithm. IEEE Access.
Kitchenham, Barbara, Pretorius, Rialette, Budgen, David, Brereton, O. Pearl, Turner, Mark, Niazi, Mahmood, & Linkman, Stephen. (2010). Systematic literature reviews in software engineering--a tertiary study. Information and Software Technology, 52(8), 792–805.
Moher, David, Liberati, Alessandro, Tetzlaff, Jennifer, & Altman, Douglas G. (2009). Preferred reporting items for systematic reviews and meta-analyses: the PRISMA statement. Bmj, 339.
Mostafa, Samih M., Idris, S. Ahmed, & Kaur, Manjit. (2022). ATS: A novel time-sharing CPU scheduling algorithm based on features similarities. Comput. Mater. Contin, 70, 6271–6288.
Omar, Hoger K., Jihad, Kamal H., & Hussein, Shalau F. (2021). Comparative analysis of the essential CPU scheduling algorithms. Bulletin of Electrical Engineering and Informatics, 10(5), 2742–2750.
Rao, G. Siva Nageswara, Srinivasu, S. V. N., Srinivasu, N., & Rao, G. Ramakoteswara. (2015). Enhanced precedence scheduling algorithm with dynamic time quantum (EPSADTQ). Research Journal of Applied Sciences, Engineering and Technology, 10(8), 938–941.
Snyder, Hannah. (2019). Literature review as a research methodology: An overview and guidelines. Journal of Business Research, 104, 333–339.
Van Eck, Nees, & Waltman, Ludo. (2009). Software survey: VOSviewer, a computer program for bibliometric mapping. Scientometrics, 84(2), 523–538.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 Jurnal ilmiah Sistem Informasi dan Ilmu Komputer
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
