现代操作系统作业答案.pptVIP

* * * * * * * * * * * * * * * * * * * * * * * 练习题： 练习题： Chapter 3 3. The bitmap needs 1 bit per allocation unit. With /n allocation units, this is /n bytes. The linked list has / or nodes, each of 8 bytes for a total of bytes. For small n, the linked list is better. For large n, the bitmap is better. The crossover point can be calculated by equating these two formulas and solving for n. The result is 1 KB. For n smaller than 1 KB, a linked list is better. For n larger than 1 KB, a bitmap is better. Of course, the assumption of segments and holes alternating every 64 KB is very unrealistic. Also, we need n = 64 KB if the segments and holes are 64 KB. 4. Request: 12KB, 10KB, 9KB First fit: 20KB, 10KB,18KB Best fit: 12KB, 10KB, 9KB Worst fit: 20KB, 18KB, 15KB Next fit: 20KB, 18KB, 9KB 5. 4KB page 8KB page 20000 (4,3616) (2,3616) 32768 (8,0) (4,0) 60000 (14,2656) (7,2656) 10KB 4KB 20KB 18KB 7KB 9KB 12KB 15KB 11. (a) A multilevel page table reduces the number of actual pages of the page table that need to be in memory because of its hierarchic structure. In fact, in a program with lots of instruction and data locality, we only need the top-level page table (one page), one instruction page and one data page. (b) Allocate 12 bits for each of the two page fields. The offset field requires 14 bits to address 16 KB. That leaves 24 bits for the page fields. Since each entry is 4 bytes, one page can hold 212 page table entries and therefore requires 12 bits to index one page. So allocating 12 bits for each of the page fields will address all 2 38 bytes. 12. Twenty bits are used for the virtual page numbers, leaving 12 over for the offset. This yields a 4-KB page. Twenty bits for the virtual page implies 2 20 pages. 14. One-level page table, 1M pages, 1M page table entries. Two-level page table, the main page table has 1K entries, each of which points t