Scribd
Upload
20 views13 pages

Disk Management & Disk Scheduling

Uploaded by

yash11.radhe
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
20 views13 pages

Disk Management & Disk Scheduling

Uploaded by

yash11.radhe
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 13

Disk Management & Disk Scheduling

PRESENTED BY :-

- SHIVANI HERLEKAR (20103A0010)


- AAYUSHA SHINDE (21102B2001)
- YASH UTTARKAR (21102B2002)
- ATHARVA DHADKE (21102B2003)
- VAISHNAVI PATIL (21102B2004)
- RAHUL GORE (21102B2005)
Introduction
What is disc ?
• Structure of disc (platter,spindle,arm
assembly,actuator,tracks)
• Seek time (time reqd to read reach track)
• Rotational latency (time reqd to reach desired sector)
• Access time(seek time+rotational latency)
• Read time(time reqd to read desired sector)
• Transmission time(access time+read time )
Disk scheduling

What • By OS schedule ,i/o request for


disk

Why • Multiple I/O Requests

Where • SSTF, FCFS


SSTF- Shortest Seek Time First
82,170,43,140,24,16,190
( )

ADVANTAGES
• OPTIMAL SOLUTION
• LESS SEEK TIME

DISADVANTAGES:
• CAN CAUSE STARVATION
FCFS (First Come First Serve)

• FCFS is the simplest disk scheduling algorithm.


• As the name suggest the algorithm takes request in order as
they arrive in the queue.
• The algorithm looks very fair and there is no starvation
• Although it does not provide the fastest service.

Advantages Disadvantages
Its greatest benefit is its simplicity It has a longer waiting time.
Can be quicky and easily implemented into It has lower device utilization.
any scheduling system
Example of First Come First Serve
• Input: Request sequence = {176, 79, 34, 60,
92, 11, 41, 114} Initial head position = 50
SCAN (Elevator Algorithm)

• In SCAN disk scheduling algorithm, head starts from one


end of the disk and moves towards the other end, servicing
requests in between one by one and reach the other end. Then
The direction of the head is reversed and the process
continues as head continuously scan back and forth to access
the disk.
Advantages Disadvantages
This algorithm is simple and easy to More complex algorithm to implement.
understand.
SCAN algorithm have no starvation. This algorithm is not fair because it cause
long waiting time for the cylinders just
visited by the head.
Example of SCAN Algorithm
• Input: Request sequence = {176, 79, 34, 60, 92, 11,
41, 114} Initial head position = 50 Direction = left
(We are moving from right to left)
C-SCAN (CIRCULAR SCAN)
• It is the modified version of SCAN Algorithm.
• C-SCAN Algorithm scan the data in only one direction.

Advantages Disadvantages
It provides better response time More seek movements are caused in C-
SCAN compared to SCAN Algorithm.
Works well with heavy loads Even if there are no requests left to be
serviced the Head will still travel to the
end of the disk unlike SCAN algorithm.
LOOK Disk Scheduling Algorithm:

• LOOK is the advanced version of SCAN (elevator) disk


scheduling algorithm which gives slightly better seek
time than any other algorithm in the hierarchy (FCFS-
>SRTF->SCAN->C-SCAN->LOOK).
• In Look Disk Scheduling Algorithm they look for
request before continuing to move in given direction.
• Like above two algorithm, Scan and C-Scan ,its Disk
arm moves across the full width of the disk…
Example of Look Scheduling Algorithm
Request sequence = {176, 79, 34, 60, 92, 11, 41, 114}
Initial head position = 50
Direction = right (toward the large value)
THANK YOU

You might also like