操作系教材统有责任高效地使用硬件对于磁盘设备.pptVIP

Chapter 14: Mass-Storage Systems Disk Structure Disk Scheduling Disk Management Swap-Space Management RAID Structure Disk Attachment Stable-Storage Implementation Tertiary Storage Devices Operating System Issues Performance Issues Disk Structure Disk drives are addressed as large 1-dimensional arrays of logical blocks, where the logical block is the smallest unit of transfer.  The 1-dimensional array of logical blocks is mapped into the sectors of the disk sequentially. Sector 0 is the first sector of the first track on the outermost cylinder. Mapping proceeds in order through that track, then the rest of the tracks in that cylinder, and then through the rest of the cylinders from outermost to innermost. 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. 旋转延迟是指等待磁盘上所需要的扇区旋转到磁头下面的时间。 Disk Scheduling Minimize seek time 最小寻道时间 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 the last transfer. 磁盘带宽，是用传输的总位数，除以第一个服务请求与最后传输完成之间的总时间。 Disk Scheduling (Cont.) Several algorithms exist to schedule the servicing of disk I/O requests. We illustrate them with a request queue (0-199).  98, 183, 37, 122, 14, 124, 65, 67 Head pointer 53 FCFS SSTF Selects the request with the minimum seek time from the current head position. SSTF scheduling is a form of SJF scheduling; may cause starvation of some requests. Illustration shows total head movement of 236 cylinders. SSTF (Cont.) SCAN The