操作系统概念英文课件：12 Mass-Storage Systems.pptVIP

Applied Operating System Concepts 13.* Applied Operating System Concepts 12: Mass-Storage Systems Disk Structure Disk Scheduling Disk Management Applied Operating System Concepts Disk Structure Disk drives are addressed as large 1-dimensional arrays of logical blocks, where the logical block is the smallest unit of transfer. Applied Operating System Concepts Applied Operating System Concepts 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. Applied Operating System Concepts 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. Applied Operating System Concepts Rotational latency is the additional time waiting for the disk to rotate the desired sector to the disk head. 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. Applied Operating System Concepts 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 Applied Operating System Concepts FCFS Illustration shows total head movement of 640 cylinders. Applied Operating System Concepts Applied Operating System Concepts 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. I