Performance Assessment of CPU Scheduling Algorithms: A Scenario-Based Approach with FCFS, RR, and SJF
- 1 Department of Computer Science and Information Systems, College of Applied Sciences, AlMaarefa University, Saudi Arabia
Abstract
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.
DOI: https://doi.org/10.3844/jcssp.2024.972.985
Copyright: © 2024 Olaa Hajjar, Escelle Mekhallalati, Nada Annwty, Faisal Alghayadh, Ismail Keshta and Mohammed Algabri. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
- 1,305 Views
- 558 Downloads
- 0 Citations
Download
Keywords
- CPU Scheduling Algorithms
- Process Management in Operating Systems
- First-Come
- First-Served (FCFS) Scheduling
- Round Robin (RR) Scheduling
- Shortest Job First (SJF)