•  
  •  
 

ASEAN Journal on Science and Technology for Development

Abstract

CPU scheduling issues include minimizing waiting time for processes, ensuring fairness in resource allocation, and optimizing throughput. Balancing these objectives can be challenging, as improving one aspect may negatively impact another, making it essential to design efficient scheduling algorithms. This work presents an innovative approach to enhance CPU utilization through the development of a Result-Based Round Robin Scheduling Algorithm. Traditional Round Robin Scheduling methods often face challenges in efficiently allocating CPU time, leading to suboptimal system performance. In response to these limitations, the proposed method introduces a result-oriented strategy that dynamically adjusts time quantum allocations based on the execution progress of processes. This adaptability aims to optimize CPU utilization by prioritizing processes with pending results of time, thus minimizing idle CPU time and improving overall system efficiency. This work defines the Advanced Round Robin Method (ARRM) by considering different time quantum at each iteration. Moreover, the general mathematical formula is also given for finding the total waiting time of the algorithm. This formula is verified through random examples and it is found that the total waiting time is minimum in 90% examples by ARRM as compared with Round Robin Method. The experimental evaluation demonstrates the algorithm's effectiveness in enhancing throughput, reducing response times, and achieving a fair distribution of resources. The Result-Based Round Robin Scheduling Algorithm emerges as a promising solution for optimizing CPU utilization in modern operating systems

Keywords

CPU Scheduling, Round Robin, Optimization, Result-Based Scheduling, System Performance, Time Quantum, Process Execution, Throughput

Publication Date

2025

Received Date

23/08/2024

Revised Date

17/10/2024

Accepted Date

19/11/2024

Download

Share

COinS