资源描述
,#,12/7/2020,单击此处编辑母版标题样式,单击此处编辑母版文本样式,第二级,第三级,第四级,第五级,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,1,11/11/2024,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.,2,11/11/2024,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.,旋转延迟是指等待磁盘上所需要的扇区旋转到磁头下面的时间。,3,11/11/2024,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.,磁盘带宽，是用传输的总位数，除以第一个服务请求与最后传输完成之间的总时间。,4,11/11/2024,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,5,11/11/2024,FCFS,Illustration shows total head movement of 640 cylinders.,6,11/11/2024,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.,7,11/11/2024,SSTF(Cont.),8,11/11/2024,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 208 cylinders.,9,11/11/2024,SCAN(Cont.),10,11/11/2024,C-SCAN,Provides a more uniform wait time than 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.,11,11/11/2024,C-SCAN(Cont.),12,11/11/2024,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.,13,11/11/2024,C-LOOK(Cont.),14,11/11/2024,Selecting a Disk-Scheduling Algorithm,SSTF is common and has a natural appeal,SCAN and C-SCAN perform better for systems that place a heavy load on the disk.,Performance depends on the number and types of requests.,Requests for disk service can be influenced by the file-allocation method.,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.,15,11/11/2024,Disk Management,Low-level formatting,or,physical formatting,Dividing a disk into sectors that the disk controller can read and write.,To use a disk to hold files,the operating system still needs to record its own data structures on the disk.,Partition,the disk into one or more groups of cylinders.,Logical formatting,or“making a file system”.,Boot block initializes system.,The bootstrap is stored in ROM.,Bootstrap loader,program.,Methods such as,sector sparing,used to handle bad blocks.,16,11/11/2024,MS-DOS Disk Layout,17,11/11/2024,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,or,more commonly,it can be in a separate disk partition.,Swap-space management,4.3BSD allocates swap space when process starts;holds,text segment,(the program)and,data segment.,Kernel uses,swap maps,to track swap-space use.,Solaris 2 allocates swap space only when a page is forced out of physical memory,not when the virtual memory page is first created.,18,11/11/2024,4.3 BSD Text-Segment Swap Map,19,11/11/2024,4.3 BSD Data-Segment Swap Map,20,11/11/2024,RAID Structure,RAID,multiple disk drives provides,reliability,via,redundancy,.,RAID is arranged into six different levels.,21,11/11/2024,RAID(cont),Several improvements in disk-use techniques inv
展开阅读全文