Submitted to:

Sir Zaid Bin Tariq Baig

Submitted by:
Muhammad Amir Khan (42)
Bachelors of Information Technology

(BSIT)
2018F-mulbsit-035
4Th Semester
Assignment No.2 :
Virtual System and Services
(Disk Scheduling)

Department of Computer Science &

Information Technology

MINHAJ
UNIVERSI
TY,
LAHORE
What is Disk Scheduling?
The procedure that working framework or Operating System (OS) uses to decide the request
which is to be fulfilled next is called Disk Scheduling.

Disk Scheduling is significant in light of the fact that Multiple I/O requests may show up by various
procedures and just a single I/O request can be served at once by the disk controller.

CPU is isolated into the different Processes and furthermore confirms that all the procedures will
Work Properly. With the goal that Disk Scheduling Will Specifies that at which time which Process will
be executed by the CPU. With the goal that the Scheduling intends to Execute all the Processes
those are given to a CPU at once.

The Scheduling is utilized for Divide the Total Time of the CPU between the Number or Processes So
that the Processes can execute Concurrently at a Single Time. For Sharing the Time or For Dividing
the Total Time of the CPU, the CPU utilizes the accompanying the Scheduling Techniques.

 FCFS or First Come First Serve:

FCFS Disk Scheduling Algorithm is the most straightforward or simplest Disk Scheduling
technique that works the request on First Come First Serve order or basis. For Example, The
procedure which shows up first in the circle line is engaged first.

 SSTF or Shortest Seek Time First:

In this Technique The Operating System will Search for the Shortest time implies this will
look through which operation will takes a Less Time of CPU for Running. After Examining all the
operations, all the Jobs are Organized into the Priority Order. The Priority of the Process will be the
Total Time which a Process will use For Execution. The Shortest Seek Time Will Include constantly
implies Time to Enter and Time to Completion of the Process. Means the Total Time which a Process
Will Take For Execution.

 C-Scan Scheduling:

In the C-Scan Scheduling the CPU will look for the Process from Start to end and on the off
chance that an End has Found, at that point this again start from the Starting Process. Since Many
Times When a CPU is executing the procedures at that point may a client needs to enter a few
information implies a client needs to enter Some information So that at that Situation the CPU will
Again Execute that Process after the Input Operation. So C-Scan Scheduling is utilized for
Processing Same Processes over and over.

 Look Scheduling:

In the Look Scheduling the CPU Scans the List from Starting to End of the Disk wherein
the different Processes are Running and in the Look Scheduling the CPU will Scan the Entire
Disk from one End to the Second end.