Process
A process is essentially running software. The
execution of any process must occur in a specific order. A
process refers to an entity that helps in representing the
fundamental unit of work that must be implemented in
any system.
scheduling diagram of process
States of Process
A process is in one of the following states:
•New: Newly Created Process (or) being-created
process.
•Ready: After the creation process moves to the
Ready state, i.e. the process is ready for
execution.
•Running: Currently running process in CPU (only one
process at a time can be under execution in a single
processor).
•Wait (or Block): When a process requests I/O
access.
.
•Complete (or Terminated): The process
completed its execution.
•Suspended Ready: When the ready queue
becomes full, some processes are moved to a
suspended ready state
•Suspended Block: When the waiting queue
becomes full
Process Scheduling
Algorithms
The operating system can use different scheduling
algorithms to schedule processes. Here are some
commonly used timing algorithms:
Four type of scheduling
algorithms
First-Come, First-Served (FCFS)
Shortest Job First (SJF)
Priority Scheduling(RS)
Round Robin (RR)
First-Come, First-Served
(FCFS):
This is the simplest scheduling algorithm,
where the process is executed on a first-
come, first-served basis. FCFS is non-
preemptive, which means that once a
process starts executing, it continues until it
is finished or waiting for I/O.
Shortest Job First
(SJF):
