操作系统第九版部分课后作业习题答案分析解析(共18页).doc

《操作系统第九版部分课后作业习题答案分析解析(共18页).doc》由会员分享，可在线阅读，更多相关《操作系统第九版部分课后作业习题答案分析解析(共18页).doc（18页珍藏版）》请在淘文阁 - 分享文档赚钱的网站上搜索。

1、精选优质文档-倾情为你奉上CHAPTER 9 Virtual MemoryPractice Exercises9.1 Under what circumstances do page faults occur? Describe the actionstaken by the operating system when a page fault occurs.Answer:A page fault occurs when an access to a page that has not beenbrought into main memory takes place. The operatin

2、g system veriesthe memory access, aborting the program if it is invalid. If it is valid, afree frame is located and I/O is requested to read the needed page intothe free frame. Upon completion of I/O, the process table and page tableare updated and the instruction is restarted.9.2 Assume that you ha

3、ve a page-reference string for a process with mframes (initially all empty). The page-reference string has length p;n distinct page numbers occur in it. Answer these questions for anypage-replacement algorithms:a. What is a lower bound on the number of page faults?b. What is an upper bound on the nu

4、mber of page faults?Answer:a. nb. p9.3 Consider the page table shown in Figure 9.30 for a system with 12-bitvirtual and physical addresses and with 256-byte pages. The list of freepage frames is D, E, F (that is, D is at the head of the list, E is second,and F is last).Convert the following virtual

5、addresses to their equivalent physicaladdresses in hexadecimal. All numbers are given in hexadecimal. (Adash for a page frame indicates that the page is not in memory.) 9EF 1112930 Chapter 9 Virtual Memory 700 0FFAnswer: 9E F - 0E F 111 - 211 700 - D00 0F F - EFF9.4 Consider the following page-repla

6、cement algorithms. Rank these algorithms on a ve-point scale from “bad” to “perfect” according to theirpage-fault rate. Separate those algorithms that suffer from Beladysanomaly from those that do not.a. LRU replacementb. FIFO replacementc. Optimal replacementd. Second-chance replacementAnswer:Rank

7、Algorithm Suffer from Beladys anomaly1 Optimal no2 LRU no3 Second-chance yes4 FIFO yes9.5 Discuss the hardware support required to support demand paging.Answer:For every memory-access operation, the page table needs to be consultedto check whether the corresponding page is resident or not and whethe

8、rthe program has read or write privileges for accessing the page. Thesechecks have to be performed in hardware. A TLB could serve as a cacheand improve the performance of the lookup operation.9.6 An operating system supports a paged virtual memory, using a centralprocessor with a cycle time of 1 mic

9、rosecond. It costs an additional 1microsecond to access a page other than the current one. Pages have 1000words, and the paging device is a drum that rotates at 3000 revolutionsper minute and transfers 1 million words per second. The followingstatistical measurements were obtained from the system: 1

10、 percent of all instructions executed accessed a page other than thecurrent page.Of the instructions that accessed another page, 80 percent accesseda page already in memory.Practice Exercises 31When a new page was required, the replaced page was modied 50percent of the time.Calculate the effective i

11、nstruction time on this system, assuming that thesystem is running one process only and that the processor is idle duringdrum transfers.Answer:effective access time = 0.99 (1sec + 0.008 (2 sec)+ 0.002 (10,000 sec + 1,000 sec)+ 0.001 (10,000 sec + 1,000 sec)= (0.99 + 0.016 + 22.0 + 11.0)sec= 34.0sec9

12、.7 Consider the two-dimensional array A:int A = new int100100;where A00 is at location 200 in a paged memory system with pagesof size 200. A small process that manipulates the matrix resides in page0 (locations 0 to 199). Thus, every instruction fetch will be from page 0.For three page frames, how m

13、any page faults are generated bythe following array-initialization loops, using LRU replacement andassuming that page frame 1 contains the process and the other twoare initially empty?a. for (int j = 0; j 100; j+)for (int i = 0; i 100; i+)Aij = 0;b. for (int i = 0; i 100; i+)for (int j = 0; j 100; j

14、+)Aij = 0;Answer:a. 5,000b. 509.8 Consider the following page reference string:1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.How many page faults would occur for the following replacementalgorithms, assuming one, two, three, four, ve, six, or seven frames?Remember all frames are initial

15、ly empty, so your rst unique pages willall cost one fault each.LRU replacement FIFO replacementOptimal replacement32 Chapter 9 Virtual MemoryAnswer:Number of frames LRU FIFO Optimal1 20 20 202 18 18 153 15 16 114 10 14 85 8 10 76 7 10 77 77 79.9 Suppose that you want to use a paging algorithm that r

16、equires a referencebit (such as second-chance replacement or working-set model), butthe hardware does not provide one. Sketch how you could simulate areference bit even if one were not provided by the hardware, or explainwhy it is not possible to do so. If it is possible, calculate what the costwoul

17、d be.Answer:You can use the valid/invalid bit supported in hardware to simulate thereference bit. Initially set the bit to invalid. On rst reference a trap to theoperating system is generated. The operating system will set a softwarebit to 1 and reset the valid/invalid bit to valid.9.10 You have dev

18、ised a new page-replacement algorithm that you think maybe optimal. In some contorted test cases, Beladys anomaly occurs. Is thenew algorithm optimal? Explain your answer.Answer:No. An optimal algorithm will not suffer from Beladys anomaly becauseby denitionan optimal algorithm replaces the page tha

19、t will notbe used for the longest time. Beladys anomaly occurs when a pagereplacement algorithm evicts a page that will be needed in the immediatefuture. An optimal algorithm would not have selected such a page.9.11 Segmentation is similar to paging but uses variable-sized“pages.”Denetwo segment-rep

20、lacement algorithms based on FIFO and LRU pagereplacement schemes. Remember that since segments are not the samesize, the segment that is chosen to be replaced may not be big enoughto leave enough consecutive locations for the needed segment. Considerstrategies for systems where segments cannot be r

21、elocated, and thosefor systems where they can.Answer:a. FIFO. Find the rst segment large enough to accommodate theincoming segment. If relocation is not possible and no one segmentis large enough, select a combination of segments whose memoriesare contiguous, which are “closest to the rst of the lis

22、t” andwhich can accommodate the new segment. If relocation is possible,rearrange the memory so that the rstNsegments large enough forthe incoming segment are contiguous in memory. Add any leftoverspace to the free-space list in both cases.Practice Exercises 33b. LRU. Select the segment that has not

23、been used for the longestperiod of time and that is large enough, adding any leftover spaceto the free space list. If no one segment is large enough, selecta combination of the “oldest” segments that are contiguous inmemory (if relocation is not available) and that are large enough.If relocation is

24、available, rearrange the oldest N segments to becontiguous in memory and replace those with the new segment.9.12 Consider a demand-paged computer system where the degree of multiprogramming is currently xed at four. The system was recently measured to determine utilization of CPU and the paging disk

25、. The resultsare one of the following alternatives. For each case, what is happening?Can the degree of multiprogramming be increased to increase the CPUutilization? Is the paging helping?a. CPU utilization 13 percent; disk utilization 97 percentb. CPU utilization 87 percent; disk utilization 3 perce

26、ntc. CPU utilization 13 percent; disk utilization 3 percentAnswer:a. Thrashing is occurring.b. CPU utilization is sufciently high to leave things alone, andincrease degree of multiprogramming.c. Increase the degree of multiprogramming.9.13 We have an operating system for a machine that uses base and

27、 limitregisters, but we have modied the machine to provide a page table.Can the page tables be set up to simulate base and limit registers? Howcan they be, or why can they not be?Answer:The page table can be set up to simulate base and limit registers providedthat the memory is allocated in xed-size

28、 segments. In this way, the baseof a segment can be entered into the page table and the valid/invalid bitused to indicate that portion of the segment as resident in the memory.There will be some problem with internal fragmentation.9.27.Consider a demand-paging system with the following time-measured

29、 utilizations:CPUutilization 20%Paging disk 97.7%OtherI/Odevices 5%Which (if any) of the following will (probably) improve CPU utilization? Explain your answer.a. Install a fasterCPU.b. Install a bigger paging disk.c. Increase the degree of multiprogramming.d. Decrease the degree of multiprogramming

30、.e. Install more main memory.f. Install a faster hard disk or multiple controllers with multiple hard disks.g. Add prepaging to the page fetch algorithms.h. Increase the page size.Answer:The system obviously is spending most of its time paging, indicating over-allocationof memory. If the level of mu

31、ltiprogramming is reduced resident processeswould page fault less frequently and theCPUutilization would improve. Another way toimprove performance would be to get more physical memory or a faster paging drum.a. Get a fasterCPUNo.b. Get a bigger paging drumNo.c. Increase the degree of multiprogrammi

32、ngNo.d. Decrease the degree of multiprogrammingYes.e. Install more main memoryLikely to improveCPUutilization as more pages canremain resident and not require paging to or from the disks.f. Install a faster hard disk, or multiple controllers with multiple hard disksAlso animprovement, for as the dis

33、k bottleneck is removed by faster response and morethroughput to the disks, theCPUwill get more data more quickly.g. Add prepaging to the page fetch algorithmsAgain, theCPUwill get more datafaster, so it will be more in use. This is only the case if the paging action is amenableto prefetching (i.e.,

34、 some of the access is sequential).h. Increase the page sizeIncreasing the page size will result in fewer page faults ifdata is being accessed sequentially. If data access is more or less random, morepaging action could ensue because fewer pages can be kept in memory and moredata is transferred per

35、page fault. So this change is as likely to decrease utilizationas it is to increase it.10.1、Is disk scheduling, other than FCFS scheduling, useful in a single-userenvironment? Explain your answer.Answer: In a single-user environment, the I/O queue usually is empty.Requests generally arrive from a si

36、ngle process for one block or for asequence of consecutive blocks. In these cases, FCFS is an economicalmethod of disk scheduling. But LOOK is nearly as easy to programand will give much better performance when multiple processes areperforming concurrent I/O, such as when aWeb browser retrieves data

37、in the background while the operating system is paging and anotherapplication is active in the foreground.10.2.Explain why SSTF scheduling tends to favor middle cylinders over theinnermost and outermost cylinders.The center of the disk is the location having the smallestaverage distance to all other

38、 tracks.Thus the disk head tends to moveaway from the edges of the disk.Here is another way to think of it.Thecurrent location of the head divides the cylinders into two groups.Ifthe head is not in the center of the disk and a new request arrives,thenew request is more likely to be in the group that

39、 includes the centerof the disk;thus,the head is more likely to move in that direction.10.11、Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 143, and the previous request was at cylinder 125. The queue of pending requests, in FIF

40、O order, is86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests, for each of the following disk-scheduling algorithms?a. FCFSb. SSTFc. SCANd. LOOKe. C-SCANAnswer:a

41、. The FCFS schedule is 143, 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130. The total seek distance is 7081.b. The SSTF schedule is 143, 130, 86, 913, 948, 1022, 1470, 1509, 1750, 1774. The total seek distance is 1745.c. The SCAN schedule is 143, 913, 948, 1022, 1470, 1509, 1750, 1774, 4999, 130, 8

42、6. The total seek distance is 9769.d. The LOOK schedule is 143, 913, 948, 1022, 1470, 1509, 1750, 1774, 130, 86. The total seek distance is 3319.e. The C-SCAN schedule is 143, 913, 948, 1022, 1470, 1509, 1750, 1774, 4999, 86, 130. The total seek distance is 9813.f. (Bonus.) The C-LOOK schedule is 14

43、3, 913, 948, 1022, 1470, 1509, 1750, 1774, 86, 130. The total seek distance is 3363.12CHAPTERFile-SystemImplementationPractice Exercises12.1 Consider a le currently consisting of 100 blocks. Assume that the lecontrol block (and the index block, in the case of indexed allocation)is already in memory.

44、 Calculate how many disk I/O operations arerequired for contiguous, linked, and indexed (single-level) allocationstrategies, if, for one block, the following conditions hold. In thecontiguous-allocation case, assume that there is no room to grow atthe beginning but there is room to grow at the end.

45、Also assume thatthe block information to be added is stored in memory.a. The block is added at the beginning.b. The block is added in the middle.c. The block is added at the end.d. The block is removed from the beginning.e. The block is removed from the middle.f. The block is removed from the end.An

46、swer:The results are:Contiguous Linked Indexeda. 201 1 1b. 101 52 1c. 1 3 1d. 198 1 0e. 98 52 0f. 0 100 012.2 What problems could occur if a system allowed a le system to bemounted simultaneously at more than one location?Answer:4344 Chapter 12 File-System ImplementationThere would be multiple paths

47、 to the same le, which could confuseusers or encourage mistakes (deleting a le with one path deletes thele in all the other paths).12.3 Why must the bit map for le allocation be kept on mass storage, ratherthan in main memory?Answer:In case of system crash (memory failure) the free-space list would notbe lost as it would be if the bit map had been stored in main memory.12.4 Consider a system that supports the strategies of contiguous, linked,and indexed allocation. What criteria should be used in deciding whi