Advanced Algorithm An

CPU Scheduling Algorithms

11/11/2023

Submitted to: Dr. Amjad

Introduction:
The purpose of this research is to contrast the features of CPU scheduling techniques. and also discuss its
advantages and disadvantages, towards Which algorithm is the most useful for enhancing CPU usage.
Numerous scheduling algorithms have been compared, with numerous factors taken into account, including
performance, algorithm implementation, flaws, average waiting times, benefits and downsides, allocation
criteria, etc.
Motivation:
The paper delves into the significance of CPU scheduling algorithms in multiprogramming operating systems,
emphasizing their pivotal role in system functionality and maximizing CPU utilization. The primary motivation
is to contrast various CPU scheduling techniques, discussing their advantages and disadvantages, with the
ultimate goal of determining the most effective algorithm for enhancing CPU usage.
Problem Statement:
Scheduling is a critical aspect of operating systems, significantly influencing CPU performance. The paper
identifies the need for efficient scheduling algorithms in a multiprocessing scenario to manage processes
effectively. The focus is on understanding the essential CPU scheduling methods and selecting the best
algorithm based on system requirements.
Strengths:
1. Motivation and Relevance:
The paper begins well by highlighting the importance of CPU scheduling in multiprogramming operating
systems and its impact on system functionality. The motivation to determine the most effective algorithm for
enhancing CPU usage is clear and relevant.
2. Comprehensive Coverage:
The paper covers a broad spectrum of CPU scheduling algorithms, including both preemptive and non-
preemptive approaches. It explores various criteria such as CPU utilization, throughput, and response time,
providing a comprehensive overview of the topic.
3. Metric Consideration:
The inclusion of diverse metrics like CPU utilization, throughput, burst time, completion time, turnaround
time, waiting time, time to response, and equity demonstrates a thoughtful approach to evaluating scheduling
algorithms.
4. Algorithm Descriptions:
The paper provides concise descriptions of each scheduling algorithm, making it accessible to readers who
may not be experts in the field.
5. Clear Structure:
The paper follows a clear structure, with sections dedicated to criteria, scheduling techniques, specific
algorithms, and a contrast between different algorithms. This organization aids in understanding the content.

Weaknesses:

1. Lack of Specifics:
The paper mentions "numerous factors" and "numerous scheduling algorithms" without specifying the exact
algorithms considered. Providing specific examples and details would enhance the paper's credibility.
2. Limited Methodological Detail:
The paper lacks information about the methodology used for comparing the scheduling algorithms. It would
benefit from details on the experimental setup and criteria used for the comparisons.
3. Unsubstantiated Claims:
Statements such as "none of them are perfect in all dimensions" need more substantiation. The paper could
benefit from empirical evidence or references to support such broad claims.
4. Incomplete Future Work Section:
The future work section mentions the possibility of upcoming research without specifying potential directions
or areas of improvement. A more detailed discussion of future research avenues would strengthen this section.
5. Formatting and Terminology:
There are minor grammatical issues and inconsistent use of terminology. A thorough proofreading to ensure
clarity and consistency would enhance the paper's professionalism.
6. Absence of Citations:
The paper lacks citations to support statements and claims. Incorporating references to existing research
would strengthen the paper's academic foundation.
7. Depth of Analysis:
While the paper mentions the goal of understanding fundamental CPU scheduling methods, it could benefit
from a deeper analysis of each algorithm's strengths and weaknesses, possibly supported by real-world
examples or case studies.
Overall Impression:
The paper provides a good introduction to CPU scheduling algorithms, but to enhance its quality, it should
include more specific details, methodological rigor, and empirical evidence. Strengthening the future work
section and ensuring consistency in formatting and terminology would contribute to a more polished and
impactful research paper.
Contributions:

The paper contributes by thoroughly exploring CPU scheduling criteria, algorithm approaches, and specific
scheduling techniques. It highlights the importance of metrics such as CPU utilization, throughput, burst time,
completion time, turnaround time, waiting time, time to response, and equity in evaluating scheduling
algorithms. The detailed examination covers both preemptive and non-preemptive scheduling techniques.
Similarity and Differences in Findings:

The paper compares various CPU scheduling algorithms, including First Come First Serve (FCFS), Shortest Job
First (SJF), Priority Scheduling, Round Robin (RR), Longest Job First Scheduling (LJFS), Longest Remaining
Time First Schedule (LRFS), Shortest Job Remaining Time First Scheduling (SJRF), Priority Scheduling
(preemptive and non-preemptive), Multilevel Queue Scheduling Algorithm (MLQ), and Multilevel Feedback
Queue Scheduling Algorithm (MLFQ). Each algorithm is assessed based on metrics like throughput, turnaround
time, and response time. The paper recognizes the strengths and weaknesses of each algorithm, addressing
issues such as the convoy effect, maximum average waiting time, and the potential for starvation.
Future Work:

The paper concludes by acknowledging that while there are numerous CPU scheduling algorithms, none are
perfect in all dimensions. Each algorithm has its flaws, and the choice depends on the specific scenario and
system type. The author suggests that future research may lead to the discovery of optimal scheduling
algorithms, offering improved performance at minimal cost. It emphasizes the need for ongoing investigation to
find the best solutions in this area.

Reference:

Bharathi, et al. “COMPREHENSIVE ANALYSIS of CPU SCHEDULING ALGORITHMS.” 9 Sept. 2022.