TY  - JOUR
AU  - Hajjar, Olaa 
AU  - Mekhallalati, Escelle 
AU  - Annwty, Nada 
AU  - Alghayadh, Faisal 
AU  - Keshta, Ismail 
AU  - Algabri, Mohammed 
PY  - 2024
TI  - Performance Assessment of CPU Scheduling Algorithms: A Scenario-Based Approach with FCFS, RR, and SJF
JF  - Journal of Computer Science
VL  - 20
IS  - 9
DO  - 10.3844/jcssp.2024.972.985
UR  - https://thescipub.com/abstract/jcssp.2024.972.985
AB  - This study presents an extensive examination of CPU scheduling algorithms, focusing on the First-Come, First-Served (FCFS), Round-Robin (RR), and Shortest-Job-First (SJF) strategies through a carefully designed scenario-based approach. By deploying a Java-based simulation to dynamically generate random process arrival and burst times, this study simulates a variety of operational conditions to test these scheduling algorithms’ adaptability and performance in environments that closely resemble real-world computing scenarios. The research aims to explore the effects of dynamic quantum size allocation on RR scheduling and assess its impact on system performance metrics such as response time and context switching overhead. Through a detailed analysis, this study seeks to provide new insights into the operational efficiency of the FCFS, RR, and SJF scheduling strategies, highlighting their strengths, limitations, and applicability across different computing environments.