Comparative analysis of the essential CPU scheduling algorithms

Omar, Hoger K.; Jihad, Kamal H.; Hussein, Shalau F.

doi:10.11591/eei.v10i5.2812

Cited by 8 publications

(6 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The next round of process will be executed if the current process finish below its time slice. Hence, each process will get an allocated CPU time, which will eliminate the starvation (Omar et al, 2021) (Purnomo & Putra, 2022). One the most disadvantage of round robin algorithm is more overhead of quantum or context switching.…”

Section: Figure 1 Stage Of Literature Reviewmentioning

confidence: 99%

Comparative Study: Preemptive Shortest Job First and Round Robin Algorithms

Purnomo,

Putra

2024

SinkrOn

View full text Add to dashboard Cite

Operating system is a software acting as an interface between computer hardware and user. Operating system is known as a resource manager. The main responsibility of operating system is to handle resources of computer system. Scheduling is a key concept in computer multitasking and multiprocessing operating system design by switching the CPU among process. Shortest job first (SJF) and round robin are two wellknown algorithms in CPU processing. For shortest job first, this algorithm can be preemptived. In preemptive shortest job first, when a new process coming in, the process can be interupted. Where with round robin algorithm there will be time slices, context switching, or also called quantum, between process. In this journal we wil discuss comparative study between preemptive shortest job first and round robin algorithms. Three comparative studies will be discussed to understand these two algorithms more deeply. For all comparative study, the average waiting time and average turnaround time is more for round robin algorithm. In the first comparative study, we get average waiting time 52% more. For average turnaround time, 30% more. In second comparative analysis, we get 52 % average waiting time more and we get 35 % average turnaround time more. For third comparative analysis, average waiting time we get 50% more and for average turnaround time, we get 28% more. Thus it is concluded in our comparative study for these kind of data the preemptive shortest job first is more efficient then the round robin algorithm. Keywords: comparative study, premptive shortest job first algorithm, round robin algorithm, turn around time, average waiting time, time slice

show abstract

Section: Figure 1 Stage Of Literature Reviewmentioning

confidence: 99%

Comparative Study: Preemptive Shortest Job First and Round Robin Algorithms

Purnomo,

Putra

2024

SinkrOn

View full text Add to dashboard Cite

show abstract

“…The performance of the traditional priority scheduling algorithm was enhanced by the proposed algorithm, which introduced an aging mechanism to prevent low-priority processes from being indefinitely postponed. Several variations of RR scheduling algorithms, such as shortest job first, preemptive, non-preemptive, and First Come, First Served algorithms, are analyzed in [8][9][10][11] to improve performance, CPU utilization, throughput, and context switching. The Dynamic Time Slice (DTS) algorithm, designed by the authors in [12], aims to minimize time costs by prioritizing short processes and minimizing scheduling overhead.…”

Section: Related Workmentioning

confidence: 99%

“…To sum up, evaluating the performance of scheduling algorithms requires assessing three key performance measures: waiting time, turnaround time, and context switching [8][9][10]. They can determine a scheduling algorithm's efficiency, fairness, responsiveness, and overhead.…”

Section: Context Switchingmentioning

confidence: 99%

Optimizing Task Execution: The Impact of Dynamic Time Quantum and Priorities on Round Robin Scheduling

et al. 2023

View full text Add to dashboard Cite

Task scheduling algorithms are crucial for optimizing the utilization of computing resources. This work proposes a unique approach for improving task execution in real-time systems using an enhanced Round Robin scheduling algorithm variant incorporating dynamic time quantum and priority. The proposed algorithm adjusts the time slice allocated to each task based on execution time and priority, resulting in more efficient resource utilization. We also prioritize higher-priority tasks and execute them as soon as they arrive in the ready queue, ensuring the timely completion of critical tasks. We evaluate the performance of our algorithm using a set of real-world tasks and compare it with traditional Round Robin scheduling. The results show that our proposed approach significantly improves task execution time and resource utilization compared to conventional Round Robin scheduling. Our approach offers a promising solution for optimizing task execution in real-time systems. The combination of dynamic time quantum and priorities adds a unique element to the existing literature in this field.

show abstract

“…The problem we may have is that in some requests we may need some data on one server called A which contains part of the database and the other data keep on another server, let's call it B, the data on server A may be an input to that data on server B. Such a dilemma may require careful scheduling of these requests so that processing is in the least amount of time and can get by maximizing interference in servers work (reducing the total elapsed time as much as possible) and reducing the idle time as much as possible from both servers [7], [8]. According to Johnson's procedure [1] which is based on the processing time of requests only, has improved.…”

Section: Introductionmentioning

confidence: 99%

Reducing waiting and idle time for a group of jobs in the grid computing

Almhanna¹,

Al-Turaihi²,

Murshedi³

2023

Bulletin EEI

View full text Add to dashboard Cite

Johnson's rule is a scheduling method for the sequence of jobs. Its primary goal is to find the perfect sequence of functions to reduce the amount of idle time, and it also reduces the total time required to complete all functions. It is a suitable method for scheduling the purposes of two functions in a specific time-dependent sequence for both functions and where the time factor is the only parameter used in this way. Therefore, it is not suitable for scheduling work for computers network, where there are many factors affecting the completion time such as CPU speed, memory, bandwidth, and size of data. In this research, Johnson's method will adopt by adding many factors that affect the completion time of the work so that it becomes suitable for the site’s job scheduling purposes to reduce the waiting and idle time for a group of jobs.

show abstract

Comparative analysis of the essential CPU scheduling algorithms

Cited by 8 publications

References 14 publications

Comparative Study: Preemptive Shortest Job First and Round Robin Algorithms

Comparative Study: Preemptive Shortest Job First and Round Robin Algorithms

Optimizing Task Execution: The Impact of Dynamic Time Quantum and Priorities on Round Robin Scheduling

Reducing waiting and idle time for a group of jobs in the grid computing

Contact Info

Product

Resources

About