操作系统概念课件ch14.pptVIP

CHAPTER 14: MASS-STORAGE STRUCTURE Disk Structure Disk Scheduling Disk Management Swap-Space Management RAID Structure Disk Attachment Stable-Storage Implementation Tertiary Storage Devices 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. Disk bandwidth is the total number of bytes transferred, divided by the total time between the first request. Access time has two major components Seek time is the time for the disk to move the heads to the cylinder containing the desired sector. Latency time is the additional time waiting for the disk to rotate the desired sector to the disk head. Minimize seek time ? Minimize seek distance. Minimize seek time ? Maximize disk bandwidth. Disk Scheduling 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 Disk Scheduling: FCFS The total head movement of 640 cylinders. Disk Scheduling: 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. 236 cylinders. Disk Scheduling: SCAN Sometimes called the elevator algorithm. The head continuously scans back and forth across the disk. 208 cylinders. Disk Scheduling: C-SCAN C-SCAN (Circular SCAN) Provides a more uniform wait time than SCAN. Treats the cylinders as a