Scheduling is the process in which work is controlled, managed, and optimized in a production process or manufacturing process. Schedule are always assigned to the process on the priority of the process means the process are with higher priority schedule first and the process with the less priority schedule last to complete the task/work.
In an operating system, CPU scheduling is the process which
allowed one process to use the CPU while other processes are on hold (means
waiting for the CPU which are used by the other process in the system).
All the processes are available in the ready queue. the main task of the CPU scheduling is whenever the CPU remains idle, the OS select at least one process from the ready queue for execution.
# Types
of CPU Scheduling:
1 1. Preemptive Scheduling.
2. Non-preemptive Scheduling.
#
Preemptive Scheduling: In CPU if the running process is interrupted
or released from the execution due to a higher priority process is known as
Preemptive Scheduling.
#
Non-Preemptive Scheduling: The process can not interrupt or
released if the new process is entering into the CPU is known as Non-Preemptive
Scheduling.
# The main aim of the CPU Scheduling:
1.
Maximize throughput.
2.
Maximize CPU Utilization.
3.
Minimize Waiting time.
4.
Minimize Response time.
5. Minimize Turnaround time.
# CPU Utilization: It’s mean the amount of
work which is handled by the CPU.
# Throughput: The numbers of processes
that finish their execution per unit time are known as throughput.
# Waiting Time: The total time spent by
the process in the ready queue for CPU.
# Response Time:
Time spent between the ready states and
getting the CPU for the first time by the process to the execution of the task.
# Turnaround Time: The total amount of time to execute a process by the CPU.
#
Types of CPU Scheduling Algorithm:
1. First Come First Serve (FCFS).
2. Shortest Job First (SJF).
3. Shortest remaining time.
4. Priority Scheduling.
5. Round Robin Scheduling.
6. Multilevel Queue Scheduling.
0 Comments