Research indexPreprint
Cyclic Scheduling Algorithm
Kumar
5 Oct 2026Open access
NobleIDark:/48914/w1/20261104/851B39BEDOI10.31219/osf.io/vxh6m_v4
Cyclic Scheduling Algorithm
Kumar · 2026
NobleIDark:/48914/w1/20261104/851B39BEDOI10.31219/osf.io/vxh6m_v4
Free to read at the publisher
You can read the abstract here, or the full text at the publisher.
Abstract
CPU Scheduling have played a critical role in making efficient systems, It is the mechanism which allows one process to use the CPU for execution while other processes are put on hold because of unavailability any required resource, with the aim of maximizing the CPU utilization and reducing the waiting time and the turnaround time. This paper presents a new Scheduling Algorithm, which supports preemption, and is evaluated using turnaround time and response time. To show its effectiveness, its comparison is done with other traditional scheduling algorithms including First Come First Serve, Shortest Job First, and Round Robin Scheduling Algorithm, and as a result it was found that the proposed algorithm provides a new and effective scheduling approach. For the four test samples, the proposed algorithm reduces the average turnaround time compared with Round Robin Scheduling Algorithm with time quantum 3, while its average response time depends on the workload.