Disk scheduling
24 likes•14,502 views
This document discusses various disk scheduling algorithms: - FCFS handles requests sequentially but suffers from the global zigzag effect. - SSTF selects the request with the minimum seek time, reducing total head movement but risking starvation. - SCAN and C-SCAN move the disk arm back and forth, providing more uniform wait times. - LOOK and C-LOOK only move as far as the last request in each direction before reversing. Circular versions like C-SCAN are more fair but have larger total seek times. The optimal algorithm depends on disk load and request patterns.
Disk scheduling
- 1. PRESENTED BY:- NEERAJ BAGHEL SONAM SINGH R.B.S ENGINEERING TECHNICAL CAMPUS Disk Scheduling
- 2. 2 Topics Of Discussion • Introduction • FCFS scheduling • SSTF scheduling • SCAN scheduling • C-SCAN scheduling • LOOK and C-LOOK scheduling
- 3. 3 PURPOSE • The purpose of this material is to provide one with help on disk scheduling algorithm. Hopefully with this,one will be able to get a stronger graps of disk scheduling algorithm do.
- 4. 4 Disk Scheduling • The operating system is responsible for using hardware efficiently — for the disk drives, this means having a fast access time and disk bandwidth. • Access time has two major components: – Seek time is the time for the disk are to move the heads to the cylinder containing the desired sector. – Rotational latency is the additional time waiting for the disk to rotate the desired sector to the disk head. • Minimize seek time ≈ seek distance. • Disk bandwidth is the total number of bytes transferred, divided by the total time between the first request for service and the completion of last transfer.
- 5. 5 Disk Scheduling • There are many sources of disk I/O request: – Os – System processes – Users processes • I/O request includes input/output mode, disk address, memory address, number of sectors to transfer. • OS maintains queue of requests, per disk or device. • Idle disk can immediately work on I/O request, busy disk means work must queue: – Optimization algorithms only make sense when a queue exists.
- 6. 6 Components of Disk I/O Transfer
- 7. 7 Disk Scheduling Algorithms • Note that drive controllers have small buffers and can manage a queue of I/O requests (of varying “depth”). • Several algorithms exist to schedule the servicing of disk I/O requests. • The analysis is true for one or many platters. • We illustrate them with a I/O request queue (cylinders are between 0-199): queue = 98, 183, 37, 122, 14, 124, 65, 67 head starts at 53
- 8. 8 Types Of Disk Scheduling Algorithm • First Come First Serve • Shortest Seek Time First • Elevator(SCAN) • Circular Scan(C-Scan) • Look • C-Look
- 9. 9 First Come First Serve (FCFS( • Handle I/O requests sequentially. • Fair to all processes. • Approaches random scheduling in performance if there are many processes/requests. • Suffers from global zigzag effect.
- 10. 10 First Come First Serve (FCFS( Illustration shows total head movement of 640 cylinders.
- 11. 11 Shortest Seek Time First (SSTF( • Selects the request with the minimum seek time from the current head position. • Also called Shortest Seek Distance First (SSDF) – It’s easier to compute distances. • It’s biased in favor of the middle cylinders requests. • SSTF scheduling is a form of SJF scheduling; may cause starvation of some requests.
- 12. 12 Shortest Seek Time First (SSTF( Illustration shows total head movement of 236 cylinders.
- 13. 13 Scan • The disk arm starts at one end of the disk, and moves toward the other end, servicing requests until it gets to the other end of the disk, where the head movement is reversed and servicing continues. • It moves in both directions until both ends. • Tends to stay more at the ends so more fair to the extreme cylinder requests.
- 14. 14 Scan Illustration shows total head movement of 208 cylinders.
- 15. 15 Look • The disk arm starts at the first I/O request on the disk, and moves toward the last I/O request on the other end, servicing requests until it gets to the other extreme I/O request on the disk, where the head movement is reversed and servicing continues. • It moves in both directions until both last I/O requests; more inclined to serve the middle cylinder requests.
- 16. 16 C-Scan • The head moves from one end of the disk to the other, servicing requests as it goes. When it reaches the other end, however, it immediately returns to the beginning of the disk, without servicing any requests on the return trip. • Treats the cylinders as a circular list that wraps around from the last cylinder to the first one. • Provides a more uniform wait time than SCAN; it treats all cylinders in the same manner.
- 17. 17 C-Scan
- 18. 18 C-Look • Look version of C-Scan. • Arm only goes as far as the last request in each direction, then reverses direction immediately, without first going all the way to the end of the disk. • In general, Circular versions are more fair but pay with a larger total seek time. • Scan versions have a larger total seek time than the corresponding Look versions.
- 19. 19 C-Look
- 20. 20 A. Frank - P. Weisberg Elevator Algorithms C-LookC-Scan Scan Look Go until the last request Go until the last cylinder Service in only one direction Service both directions Direction Go until • Algorithms based on the common elevator principle. • Four combinations of Elevator algorithms: –Service in both directions or in only one direction. –Go until last cylinder or until last I/O request.
- 21. 21 Another Example A. Frank - P. Weisberg LOOK C-LOOK
- 22. 22 Other Disk Scheduling Policies • Pickup – A combination of FCFS and Look. – Goes to next I/O request by FCFS but services all existing requests on the way to it. • Priority – Goal is not to optimize disk use but to meet other objectives. – Short batch jobs may have higher priority. – Provide good interactive response time.
- 23. 23 Selecting a Disk-Scheduling Algorithm • Performance depends on the number and types of requests. • Requests for disk service can be influenced by the file-allocation method. • The disk-scheduling algorithm should be written as a separate module of the operating system, allowing it to be replaced with a different algorithm if necessary.
- 24. 24 Selecting a Disk-Scheduling Algorithm • With low load on the disk, It’s FCFS anyway. • SSTF is common and has a natural appeal – good for medium disk load. • SCAN and C-SCAN perform better for systems that place a heavy load on the disk; Less starvation. • Performance depends on number and types of requests. • Requests for disk service can be influenced by the file- allocation method and metadata layout. • Either SSTF or LOOK (as part of an Elevator package) is a reasonable choice for the default algorithm.
- 25. 25 Thank You