Page 1 ... â¢Compromise between optimization of seek times and response times. â¢data in the middle of the ... âSCAN
www.site.uottawa.ca/~elsaddik www.el-saddik.com
Earliest Deadline First (EDF) Disk Scheduling ¾Real-time scheduling algorithm ¾Read block for stream with nearest deadline ¾Most often applied as a preemptive scheduling scheme ¾May result in: Excessive seek time and Poor throughput t
Scan-EDF Disk Scheduling SCAN: ¾Move disk head always between disk edges (BIdirectional) ¾Read next requested block in disk movement direction ¾Compromise between optimization of seek times and response times ¾data in the middle of the disk has better access properties SCAN-EDF ¾Combines advantages of: SCAN (seek optimization) with EDF (real-time aspects) ¾Method: Requests with earlier deadlines are served first Among requests with same deadline, requests are served by track location • Increase efficiency by modifying deadlines
1
www.site.uottawa.ca/~elsaddik www.el-saddik.com
SCAN-EDF Properties ¾apply EDF ¾for all requests with same deadline apply SCAN t 3 24 3 2 3 2 1 1 2 1
Group Sweeping Scheduling To reduce disk arm movements, the set of n streams is divided in to g groups. Groups are served in fixed order ¾Form groups with deadlines lying closely together or in round robin manner (in general) ¾Apply SCAN to each group deadline blockno.