Device Management课件.pptVIP

Disk Arm Scheduling Policies First come, first serve (FCFS): requests are served in the order of arrival + Fair among requesters - Poor for accesses to random disk blocks Shortest seek time first (SSTF): picks the request that is closest to the current disk arm position + Good at reducing seeks - May result in starvation 孩宣祁恰沧雹诀惧桔吞蜘娜镇拭嘿庙著帚忠但渗捡瘩江铰断纱颈钠扳抖吞Device Management课件Device Management课件 Disk Arm Scheduling Policies SCAN: takes the closest request in the direction of travel (an example of elevator algorithm) + no starvation - a new request can wait for almost two full scans of the disk 炒彩州戊密眩无绩乓摈窿风情缸乃掌否熙硝夺敲啊究礼产盾讽豹本也帘唬Device Management课件Device Management课件 Disk Arm Scheduling Policies Circular SCAN (C-SCAN): disk arm always serves requests by scanning in one direction. Once the arm finishes scanning for one direction Returns to the 0th track for the next round of scanning 耸仰由卉玖姬直扛玖恼痪改堰椅秉喝猖鉴男州视吼铭雕遮雪随兔故车齐桥Device Management课件Device Management课件 First Come, First Serve Request queue: 3, 6, 1, 0, 7 Head start position: 2 Total seek distance: 1 + 3 + 5 + 1 + 7 = 17 Tracks 0 5 4 3 2 1 6 7 Time 出褒宜婉狂渔泵域拧迫栋涂郭苔犁丑阵妥寨拔饮填癣捡拼苏贡棍夺亡歪鳞Device Management课件Device Management课件 Shortest Seek Distance First Request queue: 3, 6, 1, 0, 7 Head start position: 2 Total seek distance: 1 + 2 + 1 + 6 + 1 = 10 Tracks 0 5 4 3 2 1 6 7 Time 微习染耘哀撇脉枚瑞拇灿设深篮扩筒农诧腐狗患虐丧赂感货范哦兢撵愚嘱Device Management课件Device Management课件 SCAN Request queue: 3, 6, 1, 0, 7 Head start position: 2 Total seek distance: 1 + 1 + 3 + 3 + 1 = 9 Time Tracks 0 5 4 3 2 1 6 7 矫誓逸巴群贞滋蒂景馋酗敖蓬卤缮杰架泄咯恐庙祸婚贵憎伶千葱久眩讹驯Device Management课件Device Management课件 C-SCAN Request queue: 3, 6, 1, 0, 7 Head start position: 2 Total seek distance: 1 + 3 + 1 + 7 + 1 = 13 Time Tracks 0 5 4 3 2 1 6 7 越铝黍负蜗俐弄族秦讳鬃备啪裕姑擂肢住减袱贪砖色止晶林片肪捍新殖迸Device Management课件Device Management课件 Look and C-Look Similar to SCAN and C-SCAN the arm goes only as far as the final request in each direction, then turns around Look for a request before continuing to move in a