[go: up one dir, main page]
Scribd
Upload
84 views3 pages

Disk Scheduling Algorithms Guide

The document describes different disk scheduling algorithms: First Come First Serve (FCFS) calculates total time based on total arm motion, Shortest Seek Time First (SSTF) prioritizes the closest pending request, SCAN and C-SCAN move the disk arm inward/outward to service requests sequentially, LOOK and C-LOOK improve on SCAN by returning to the middle after serving one direction of requests to reduce variance.

Uploaded by

Vidushi Sood
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
84 views3 pages

Disk Scheduling Algorithms Guide

The document describes different disk scheduling algorithms: First Come First Serve (FCFS) calculates total time based on total arm motion, Shortest Seek Time First (SSTF) prioritizes the closest pending request, SCAN and C-SCAN move the disk arm inward/outward to service requests sequentially, LOOK and C-LOOK improve on SCAN by returning to the middle after serving one direction of requests to reduce variance.

Uploaded by

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

Examples of Disk Scheduling Algorithms

 Work Queue: 23, 89, 132, 42, 187


 there are 200 cylinders numbered from 0 - 199
 the diskhead stars at number 100

1. FCFS

total time is estimated by total arm motion

2. SSTF

3. SCAN
o assume we are going inwards (i.e., towards 0)
4. LOOK

o reduce variance compared to SCAN


5. C-SCAN
6. C-LOOK

You might also like