Presentation on theme: "Silberschatz, Galvin and Gagne 2002 13.1 Operating System Concepts Disk Scheduling Disk IO requests are for blocks, by number Block requests come in an."— Presentation transcript:
Silberschatz, Galvin and Gagne 2002 13.1 Operating System Concepts Disk Scheduling Disk IO requests are for blocks, by number Block requests come in an ongoing stream from apps Requests are queued (possibly blocking the process) until the disk is available OS can optimize disk performance by reordering the queue Require low access time and high disk bandwidth. Access time is the time to start transferring data Bandwidth is the average transfer rate, from request to completion 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. (large) Rotational latency is the additional time waiting for the disk to rotate the desired sector to the disk head. (small) Minimize seek time seek distance
Silberschatz, Galvin and Gagne 2002 13.2 Operating System Concepts Disk Scheduling (Cont.) Given a request queue of block numbers, minimize summed seek distance Block numbers are translated into track and sector numbers Higher block numbers correspond to higher track numbers Sector numbers may not be known exactly, but can be computed for analysis Example, for a disk with range 0-199: 98, 183, 37, 122, 14, 124, 65, 67 Head pointer initially at 53 Optimal service order is 37, 14, 65, 67, 98, 122, 124, 183 (208)
Silberschatz, Galvin and Gagne 2002 13.3 Operating System Concepts FCFS Illustration shows total head movement of 640 cylinders.
Silberschatz, Galvin and Gagne 2002 13.4 Operating System Concepts SSTF Selects the request with the minimum seek time from the current head position. Illustration shows total head movement of 236 cylinders. SSTF scheduling is a form of SJF scheduling; may cause starvation of some requests. Not optimal
Silberschatz, Galvin and Gagne 2002 13.5 Operating System Concepts SCAN The disk arm starts at one end of the disk, and moves toward the other end, servicing requests until it gets to the other end of the disk, where the head movement is reversed and servicing continues. Sometimes called the elevator algorithm. Illustration shows total head movement of 236 cylinders. Waste at far ends
Silberschatz, Galvin and Gagne 2002 13.6 Operating System Concepts LOOK Version of SCAN Arm only goes as far as the last request in each direction, then reverses direction immediately, without first going all the way to the end of the disk.
Silberschatz, Galvin and Gagne 2002 13.7 Operating System Concepts C-SCAN The head moves from one end of the disk to the other. servicing requests as it goes. When it reaches the other end, however, it immediately returns to the beginning of the disk, without servicing any requests on the return trip. Treats the cylinders as a circular list that wraps around from the last cylinder to the first one. Illustration shows total head movement of 183 cylinders, plus return time. Provides a more uniform wait time than SCAN.
Silberschatz, Galvin and Gagne 2002 13.8 Operating System Concepts C-LOOK Version of C-SCAN Arm only goes as far as the last request in each direction, then reverses direction immediately, without first going all the way to the end of the disk. Illustration shows total head movement of 153 cylinders, plus return time.
Silberschatz, Galvin and Gagne 2002 13.9 Operating System Concepts Selecting a Disk-Scheduling Algorithm Performance depends on the number and types of requests. SSTF is common and has a natural appeal, but can starve requests SCAN and C-SCAN perform better for systems that place a heavy load on the disk - lots of requests to hit Optimal is NP-complete. Requests for disk service can be influenced by the file-allocation method and directory layout. The disk-scheduling algorithm should be written as a separate module of the operating system, allowing it to be replaced with a different algorithm if necessary. Either SSTF or LOOK is a reasonable choice for the default algorithm. Newer disks have Lower seek time relative to latency Built in scheduling - send requests in batches OS level scheduling is important at a coarser grain level, for important disk activity, e.g., VM
Silberschatz, Galvin and Gagne 2002 13.10 Operating System Concepts Bad Blocks Disks come from the factory with bad blocks File system solutions Keep a bad blocks list, etc Low level solutions Sector sparing replaces bad blocks with spares, by a mapping in the disk controller Sector slipping slides them down Interferes with disk scheduling - thats why disks might be left to their own devices (ha ha)
Silberschatz, Galvin and Gagne 2002 13.11 Operating System Concepts Swap-Space Management Swap-space Virtual memory uses disk space as an extension of main memory. Swap-space can be Carved out of the normal file system In a separate disk partition with a special file system (no directory, etc) Combination of these, e.g., Solaris, which always rereads text pages from the file system (theyre never dirty, and hence never swapped out) Swap-space management 4.3BSD allocates swap space when process starts; holds text segment and data segment. Solaris 2 allocates swap space only when a page is forced out of physical memory, not when the virtual memory page is first created.
Silberschatz, Galvin and Gagne 2002 13.12 Operating System Concepts RAID RAID schemes improve performance and improve the reliability of the storage system by storing redundant data. Disk striping uses a group of disks as one storage unit Bit striping gives parallel transfer for all size transfer Block striping gives parallel transfer for large transfers, and concurrency for small accesses Mirroring or shadowing keeps duplicate of each disk. Block interleaved parity combines the ideas RAID is arranged into six different levels.
Silberschatz, Galvin and Gagne 2002 13.13 Operating System Concepts RAID Levels
Silberschatz, Galvin and Gagne 2002 13.14 Operating System Concepts RAID (0 + 1) and (1 + 0)